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

• 1988
• 
  Kurt M. Anstreicher:
  Linear programming and the newton barrier flow. Math. Program. 41(1-3): 367-373 (1988)
• 
  Dominique Azé:
  An example of stability for the minima of a sequence of dc functions: Homogenization for a class of nonlinear Sturm-Liouville problems. Math. Program. 41(1-3): 127-140 (1988)
• 
  Mireille L. Bougeard:
  Morse theory for some lower-C² functions in finite dimension. Math. Program. 41(1-3): 141-159 (1988)
• 
  Jean-Marie Bourjolly:
  An extension of the könig-egerváry property to node-weighted bidirected graphs. Math. Program. 41(1-3): 375-384 (1988)
• 
  Bernard Cornet, Van Hien Nguyen, Jean-Pierre Vial:
  Mathematical programming study 30 - Nonlinear Analysis and Optimization. Math. Program. 41(1-3): 119-121 (1988)
• 
  I. I. Dikin:
  Letter to the editor. Math. Program. 41(1-3): 393-394 (1988)
• 
  Robert Fourer:
  A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy. Math. Program. 41(1-3): 281-315 (1988)
• 
  Patrick T. Harker:
  Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. Math. Program. 41(1-3): 29-59 (1988)
• 
  Jean-Baptiste Hiriart-Urruty, Hoang Tuy:
  Note From the Editor. Math. Program. 41(1-3): 125-126 (1988)
• 
  Karla L. Hoffman, Richard H. F. Jackson, Jan Telgen:
  Mathematical programming study 31 - Computational Mathematical Programming. Math. Program. 41(1-3): 395-398 (1988)
• 
  Richard H. F. Jackson, Garth P. McCormick:
  Second-order sensitivity analysis in factorable programming: Theory and applications. Math. Program. 41(1-3): 1-27 (1988)
• 
  Philip C. Jones, James L. Zydiak, Wallace J. Hopp:
  Stationary dual prices and depreciation. Math. Program. 41(1-3): 357-366 (1988)
• 
  Hidefumi Kawasaki:
  An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems. Math. Program. 41(1-3): 73-96 (1988)
• 
  Hidefumi Kawasaki:
  The upper and lower second order directional derivatives of a sup-type function. Math. Program. 41(1-3): 327-339 (1988)
• 
  Hiroshi Konno:
  Minimum concave cost production system: A further generalization of multi-echelon model. Math. Program. 41(1-3): 185-193 (1988)
• 
  Thomas L. Magnanti, James B. Orlin:
  Parametric linear programming and anti-cycling pivoting rules. Math. Program. 41(1-3): 317-325 (1988)
• 
  Ramon E. Moore, Helmut Ratschek:
  Inclusion functions and global optimization II. Math. Program. 41(1-3): 341-356 (1988)
• 
  Jean-Paul Penot, Mireille L. Bougeard:
  Approximation and decomposition properties of some classes of locally D.C. functions. Math. Program. 41(1-3): 195-227 (1988)
• 
  David M. Ryan, Michael R. Osborne:
  On the solution of highly degenerate linear programmes. Math. Program. 41(1-3): 385-392 (1988)
• 
  David F. Shanno:
  Computing Karmarkar projections quickly. Math. Program. 41(1-3): 61-71 (1988)
• 
  Phan Thien Thach:
  The design centering problem as a D.C. programming problem. Math. Program. 41(1-3): 229-248 (1988)
• 
  Tran Vu Thieu:
  A note on the solution of bilinear programming problems by reduction to concave minimization. Math. Program. 41(1-3): 249-260 (1988)
• 
  Michael J. Todd:
  Exploiting special structure in Karmarkar's linear programming algorithm. Math. Program. 41(1-3): 97-113 (1988)
• 
  Hoang Tuy, Reiner Horst:
  Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems. Math. Program. 41(1-3): 161-183 (1988)
• 
  Michel Volle:
  Concave duality: Application to problems dealing with difference of functions. Math. Program. 41(1-3): 261-278 (1988)