• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 26 matches

• 1971
• 
  Michel L. Balinski, Philip Wolfe:
  The journal. Math. Program. 1(1): 1-5 (1971)
• 
  R. Benayoun, J. de Montgolfier, J. Tergny, O. Laritchev:
  Linear programming with multiple objective functions: Step method (stem). Math. Program. 1(1): 366-375 (1971)
• 
  Michel Bénichou, Jean-Michel Gauthier, Paul Girodet, Gerard Hentges, Gerard Ribière, O. Vincent:
  Experiments in mixed-integer linear programming. Math. Program. 1(1): 76-94 (1971)
• 
  Abraham Berman, Adi Ben-Israel:
  Linear inequalities, mathematical programming and matrix theory. Math. Program. 1(1): 291-300 (1971)
• 
  Louis J. Billera:
  Some recent results in n-person game theory. Math. Program. 1(1): 58-67 (1971)
• 
  Richard W. Cottle, Jacques A. Ferland:
  On pseudo-convex functions of nonnegative variables. Math. Program. 1(1): 95-101 (1971)
• 
  T. B. Crabill, James P. Evans, Floyd J. Gould:
  An example of an ill-conditioned nlp problem. Math. Program. 1(1): 113-116 (1971)
• 
  B. Curtis Eaves:
  On the basic theorem of complementarity. Math. Program. 1(1): 68-75 (1971)
• 
  Jack Edmonds:
  Matroids and the greedy algorithm. Math. Program. 1(1): 127-136 (1971)
• 
  Delbert Ray Fulkerson:
  Blocking and anti-blocking pairs of polyhedra. Math. Program. 1(1): 168-194 (1971)
• 
  Michael D. Grigoriadis:
  A projective method for structured nonlinear programs. Math. Program. 1(1): 321-358 (1971)
• 
  Michael Held, Richard M. Karp:
  The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1): 6-25 (1971)
• 
  Eli Hellerman, Dennis C. Rarick:
  Reinversion with the preassigned pivot procedure. Math. Program. 1(1): 195-216 (1971)
• 
  T. C. Hu:
  Some problems in discrete optimization. Math. Program. 1(1): 102-112 (1971)
• 
  Harold W. Kuhn:
  Publications. Math. Program. 1(1): 117-120 (1971)
• 
  Eugene L. Lawler:
  A solvable case of the traveling salesman problem. Math. Program. 1(1): 267-269 (1971)
• 
  Antal Majthay:
  Optimality conditions for quadratic programming. Math. Program. 1(1): 359-365 (1971)
• 
  Garth P. McCormick:
  Penalty function versus non-penalty function methods for constrained nonlinear programming problems. Math. Program. 1(1): 217-238 (1971)
• 
  Roland A. Minch:
  Applications of symmetric derivatives in mathematical programming. Math. Program. 1(1): 307-320 (1971)
• 
  Alex Orden:
  On the solution of linear equation/inequality systems. Math. Program. 1(1): 137-152 (1971)
• 
  Torrence D. Parsons, Albert W. Tucker:
  Hybrid programs: Linear and least-distance. Math. Program. 1(1): 153-167 (1971)
• 
  Jean-Marie Pla:
  An "out-of-kilter" algorithm for solving minimum cost potential problems. Math. Program. 1(1): 275-290 (1971)
• 
  M. J. D. Powell:
  Recent advances in unconstrained optimization. Math. Program. 1(1): 26-57 (1971)
• 
  Bernard Roy:
  Problems and methods with multiple objective functions. Math. Program. 1(1): 239-266 (1971)
• 
  Douglass J. Wilde, J. M. Sanchez-Anton:
  Discrete optimization on a multivariable boolean lattice. Math. Program. 1(1): 301-306 (1971)
• 
  A. C. Williams:
  Notice. Math. Program. 1(1): 270-273 (1971)