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

• 1988
• 
  Jonathan F. Bard:
  Convex two-level optimization. Math. Program. 40(1-3): 15-27 (1988)
• 
  Richard H. Byrd, Robert B. Schnabel, Gerald A. Shultz:
  Approximate solution of the trust region problem by minimization over two-dimensional subspaces. Math. Program. 40(1-3): 247-263 (1988)
• 
  Robin W. Chaney:
  Second-order necessary conditions in semismooth optimization. Math. Program. 40(1-3): 95-109 (1988)
• 
  Thomas F. Coleman:
  A chordal preconditioner for large-scale optimization. Math. Program. 40(1-3): 265-287 (1988)
• 
  Anthony V. Fiacco, Jerzy Kyparisis:
  Computable bounds on parametric solutions of convex problems. Math. Program. 40(1-3): 213-221 (1988)
• 
  Bernhard Fleischmann:
  A new class of cutting planes for the symmetric travelling salesman problem. Math. Program. 40(1-3): 225-246 (1988)
• 
  David M. Gay:
  A variant of Karmarkar's linear programming algorithm for problems in standard form. Math. Program. 40(1-3): 111 (1988)
• 
  Fred W. Glover, Darwin Klingman:
  Layering strategies for creating exploitable structure in linear and integer programs. Math. Program. 40(1-3): 165-181 (1988)
• 
  Donald Goldfarb, Sanjay Mehrotra:
  Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value. Math. Program. 40(1-3): 183-195 (1988)
• 
  Donald Goldfarb, Sanjay Mehrotra:
  A relaxed version of Karmarkar's method. Math. Program. 40(1-3): 289-315 (1988)
• 
  Shih-Ping Han:
  A successive projection method. Math. Program. 40(1-3): 1-14 (1988)
• 
  Alan J. Hoffman:
  On greedy algorithms for series parallel graphs. Math. Program. 40(1-3): 197-204 (1988)
• 
  Hiroshi Imai:
  On the convexity of the multiplicative version of Karmarkar's potential function. Math. Program. 40(1-3): 29-32 (1988)
• 
  Ali Ridha Mahjoub:
  On the stable set polytope of a series-parallel graph. Math. Program. 40(1-3): 53-57 (1988)
• 
  Gerard G. L. Meyer:
  Convergence of relaxation algorithms by averaging. Math. Program. 40(1-3): 205-212 (1988)
• 
  Robert Mifflin:
  An implementation of an algorithm for univariate minimization and an application to nested optimization. Math. Program. 40(1-3): 223 (1988)
• 
  Yves Pochet, Laurence A. Wolsey:
  Lot-size models with backlogging: Strong reformulations and cutting planes. Math. Program. 40(1-3): 317-335 (1988)
• 
  James Renegar:
  A polynomial-time algorithm, based on Newton's method, for linear programming. Math. Program. 40(1-3): 59-93 (1988)
• 
  James Renegar:
  Rudiments of an average case complexity theory for piecewise-linear path following algorithms. Math. Program. 40(1-3): 113-163 (1988)
• 
  Roger L. Tobin:
  A variable dimension solution approach for the general spatial price equilibrium problem. Math. Program. 40(1-3): 33-51 (1988)