• 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 23 matches

• 1975
• 
  Joachim H. Ahrens, Gerd Finke:
  Degeneracy in fixed cost transportation problems. Math. Program. 8(1): 369-374 (1975)
• 
  Egon Balas:
  Facets of the knapsack polytope. Math. Program. 8(1): 146-164 (1975)
• 
  David E. Bell, Marshall L. Fisher:
  Improved integer programming bounds using intersections of corner polyhedra. Math. Program. 8(1): 345-368 (1975)
• 
  A. L. Brearley, Gautam Mitra, H. Paul Williams:
  Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8(1): 54-83 (1975)
• 
  A. Buckley:
  An alternate implementation of Goldfarb's minimization algorithm. Math. Program. 8(1): 207-231 (1975)
• 
  Joseph G. Ecker, Issoufou Kouada:
  Finding efficient points for linear multiple objective programs. Math. Program. 8(1): 375-377 (1975)
• 
  Jack Elzinga, Thomas G. Moore:
  A central cutting plane algorithm for the convex programming problem. Math. Program. 8(1): 134-145 (1975)
• 
  Didier Fayard, Gérard Plateau:
  Resolution of the 0-1 knapsack problem: Comparison of methods. Math. Program. 8(1): 272-307 (1975)
• 
  Fred W. Glover:
  New results on equivalent integer programming formulations. Math. Program. 8(1): 84-90 (1975)
• 
  Martin Grötschel, Manfred W. Padberg:
  Partial linear characterizations of the asymmetric travelling salesman polytope. Math. Program. 8(1): 378-381 (1975)
• 
  Peter L. Hammer, Ellis L. Johnson, Uri N. Peled:
  Facet of regular 0-1 polytopes. Math. Program. 8(1): 179-206 (1975)
• 
  Gabor T. Herman:
  A relaxation method for reconstructing objects from noisy X-rays. Math. Program. 8(1): 1-19 (1975)
• 
  H. R. Howson, N. G. F. Sancho:
  A new algorithm for the solution of multi-state dynamic programming problems. Math. Program. 8(1): 104-116 (1975)
• 
  P. Huard:
  Optimization algorithms and point-to-set-maps. Math. Program. 8(1): 308-331 (1975)
• 
  R. Lehmann, Werner Oettli:
  The theorem of the alternative, the key-theorem, and the vector-maximum problem. Math. Program. 8(1): 332-344 (1975)
• 
  Robert Mifflin:
  Convergence bounds for nonlinear programming algorithms. Math. Program. 8(1): 251-271 (1975)
• 
  George L. Nemhauser, Leslie E. Trotter Jr.:
  Vertex packings: Structural properties and algorithms. Math. Program. 8(1): 232-248 (1975)
• 
  David A. Pyne:
  On interior and convexity conditions, development of dual problems and saddlepoint optimality criteria in abstract mathematical programming. Math. Program. 8(1): 125-133 (1975)
• 
  G. Terry Ross, Richard M. Soland:
  A branch and bound algorithm for the generalized assignment problem. Math. Program. 8(1): 91-103 (1975)
• 
  M. Sakarovitch:
  Quasi-balanced matrices. Math. Program. 8(1): 382-386 (1975)
• 
  Franz J. M. Salzborn:
  Break minimization. Math. Program. 8(1): 43-53 (1975)
• 
  Lee J. White, Mark Lee Gillenson:
  An efficient algorithm for minimumk-covers in weighted graphs. Math. Program. 8(1): 20-42 (1975)
• 
  Laurence A. Wolsey:
  Faces for a linear inequality in 0-1 variables. Math. Program. 8(1): 165-178 (1975)