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

• 1991
• 
  Faiz A. Al-Khayyal:
  Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes Q and Q₀. Math. Program. 51: 247-255 (1991)
• 
  P. Alart, Bernard Lemaire:
  Penalization in non-classical convex programming via variational convergence. Math. Program. 51: 307-331 (1991)
• 
  J. Randall Brown:
  Solving knapsack sharing problems with general tradeoff functions. Math. Program. 51: 55-73 (1991)
• 
  Ludwig J. Cromme, Immo Diener:
  Fixed point theorems for discontinuous mapping. Math. Program. 51: 257-267 (1991)
• 
  B. Curtis Eaves, Alan J. Hoffman, Hui Hu:
  Linear programming with spheres and hemispheres of objective vectors. Math. Program. 51: 1-16 (1991)
• 
  Matteo Fischetti:
  Facts of two Steiner arborescence polyhedra. Math. Program. 51: 401-419 (1991)
• 
  Robert M. Freund:
  Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function. Math. Program. 51: 203-222 (1991)
• 
  Sara A. van de Geer, Leen Stougie:
  On rates of convergence and asymptotic normality in the multiknapsack problem. Math. Program. 51: 349-358 (1991)
• 
  Donald Goldfarb, Dong Xiao:
  A primal projective interior point method for linear programming. Math. Program. 51: 17-43 (1991)
• 
  Andreas Griewank, Hubertus Th. Jongen, Man Kam Kwong:
  The equivalence of strict convexity and injectivity of the gradient in bounded level sets. Math. Program. 51: 273-278 (1991)
• 
  Martin Grötschel, Olaf Holland:
  Solution of large-scale symmetric travelling salesman problems. Math. Program. 51: 141-202 (1991)
• 
  C. T. Kelley, Stephen J. Wright:
  Sequential quadratic programming for certain parameter identification problems. Math. Program. 51: 281-305 (1991)
• 
  Bernd Luderer:
  Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem. Math. Program. 51: 333-348 (1991)
• 
  Denis Naddef, Giovanni Rinaldi:
  The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Program. 51: 359-400 (1991)
• 
  Jong-Shi Pang:
  A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems. Math. Program. 51: 101-131 (1991)
• 
  Konstantinos Paparrizos:
  An infeasible (exterior point) simplex algorithm for assignment problems. Math. Program. 51: 45-54 (1991)
• 
  Hoang Tuy:
  Normal conical algorithm for concave minimization over polytopes. Math. Program. 51: 229-245 (1991)
• 
  Michael Werman, David Magagnosc:
  The relationship between integer and real solutions of constrained convex programming. Math. Program. 51: 133-135 (1991)
• 
  Hiroshi Yabe, Toshihiko Takahashi:
  Factorized quasi-Newton methods for nonlinear least squares problems. Math. Program. 51: 75-100 (1991)
• 
  Eugene K. Yang, Jon W. Tolle:
  A class of methods for solving large, convex quadratic programs subject to box constraints. Math. Program. 51: 223-228 (1991)
• 
  Leszek S. Zaremba:
  Perfect graphs and norms. Math. Program. 51: 269-272 (1991)