• 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

• 2003
• 
  Susanne Albers:
  Online algorithms: a survey. Math. Program. 97(1-2): 3-26 (2003)
• 
  Kurt M. Anstreicher:
  Recent advances in the solution of quadratic assignment problems. Math. Program. 97(1-2): 27-42 (2003)
• 
  David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
  Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97(1-2): 91-153 (2003)
• 
  Sanjeev Arora:
  Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97(1-2): 43-69 (2003)
• 
  David Avis, Jun Umemoto:
  Stronger linear programming relaxations of max-cut. Math. Program. 97(3): 451-469 (2003)
• 
  Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
  Progress on perfect graphs. Math. Program. 97(1-2): 405-422 (2003)
• 
  Francis Clarke:
  Necessary conditions in optimal control: a new approach. Math. Program. 97(1-2): 71-89 (2003)
• 
  Leonid Faybusovich, Takashi Tsuchiya:
  Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank. Math. Program. 97(3): 471-493 (2003)
• 
  Donald Goldfarb, Garud Iyengar:
  Robust convex quadratically constrained programs. Math. Program. 97(3): 495-515 (2003)
• 
  Atsuko Ikegami, Akira Niwa:
  A subproblem-centric model and approach to the nurse scheduling problem. Math. Program. 97(3): 517-541 (2003)
• 
  Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
  Local search algorithms for the rectangle packing problem with general spatial costs. Math. Program. 97(3): 543-569 (2003)
• 
  Hiroshi Konno, Takashi Tsuchiya:
  Preface. Math. Program. 97(3): 449-450 (2003)
• 
  Hiroshi Konno, Rei Yamamoto:
  Minimal concave cost rebalance of a portfolio to the efficient frontier. Math. Program. 97(3): 571-585 (2003)
• 
  Adrian S. Lewis:
  The mathematics of eigenvalue optimization. Math. Program. 97(1-2): 155-176 (2003)
• 
  Zhi-Quan Luo:
  Applications of convex optimization in signal processing and digital communication. Math. Program. 97(1-2): 177-207 (2003)
• 
  Zhi-Quan Luo, Jun Lu:
  On blind source separation using mutual information criterion. Math. Program. 97(3): 587-603 (2003)
• 
  Renato D. C. Monteiro:
  First- and second-order methods for semidefinite programming. Math. Program. 97(1-2): 209-244 (2003)
• 
  M. J. D. Powell:
  On trust region methods for unconstrained minimization without derivatives. Math. Program. 97(3): 605-623 (2003)
• 
  Stephen M. Robinson:
  Variational conditions with smooth constraints: structure and analysis. Math. Program. 97(1-2): 245-265 (2003)
• 
  Mikael Rönnqvist:
  Optimization in forestry. Math. Program. 97(1-2): 267-284 (2003)
• 
  Rüdiger Schultz:
  Stochastic programming with integer variables. Math. Program. 97(1-2): 285-309 (2003)
• 
  Peter W. Shor:
  Capacities of quantum channels and how to find them. Math. Program. 97(1-2): 311-335 (2003)
• 
  Miklós Simonovits:
  How to compute the volume in high dimension? Math. Program. 97(1-2): 337-374 (2003)
• 
  Daniel A. Spielman, Shang-Hua Teng:
  Smoothed analysis of termination of linear programming algorithms. Math. Program. 97(1-2): 375-404 (2003)
• 
  Jørgen Tind:
  Preface. Math. Program. 97(1-2): 1 (2003)
• 
  Laurence A. Wolsey:
  Strong formulations for mixed integer programs: valid inequalities and extended formulations. Math. Program. 97(1-2): 423-447 (2003)