• 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

• 1983
• 
  Samuel A. Awoniyi, Michael J. Todd:
  An efficient simplicial algorithm for computing a zero of a convex union of smooth functions. Math. Program. 25(1): 83-108 (1983)
• 
  Michael J. Best, Richard J. Caron:
  A method to increase the computational efficiency of certain quadratic programming algorithms. Math. Program. 25(3): 354-358 (1983)
• 
  J. Randall Brown:
  The flow circulation sharing problem. Math. Program. 25(2): 199-227 (1983)
• 
  Awi Federgruen, Paul H. Zipkin:
  Solution techniques for some allocation problems. Math. Program. 25(1): 13-24 (1983)
• 
  Robert Fourer:
  Solving staircase linear programs by the simplex method, 2: Pricing. Math. Program. 25(3): 251-292 (1983)
• 
  Richard Grinold:
  Convex infinite horizon programs. Math. Program. 25(1): 64-82 (1983)
• 
  Shih-Ping Han, Olvi L. Mangasarian:
  A dual differentiable exact penalty function. Math. Program. 25(3): 293-306 (1983)
• 
  Refael Hassin:
  The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm. Math. Program. 25(2): 228-239 (1983)
• 
  Johannes Jahn:
  Duality in vector optimization. Math. Program. 25(3): 343-353 (1983)
• 
  Philip C. Jones:
  A note on the Talman, Van der Heyden linear complementarity algorithm. Math. Program. 25(1): 122-124 (1983)
• 
  A. Kalliauer:
  An algorithm for hierarchical optimization of large-scale problems with nested structure. Math. Program. 25(1): 25-45 (1983)
• 
  Elon Kohlberg:
  Consistency of finite systems of convex inequalities. Math. Program. 25(3): 359-362 (1983)
• 
  Masakazu Kojima, Shinji Mizuno:
  Computation of all solutions to a system of polynomial equations. Math. Program. 25(2): 131-157 (1983)
• 
  Gerard van der Laan, A. J. J. Talman:
  Note on the path following approach of equilibrium programming. Math. Program. 25(3): 363-367 (1983)
• 
  Colin McDiarmid:
  Integral decomposition in polyhedra. Math. Program. 25(2): 183-198 (1983)
• 
  Bruce A. Murtagh, Fawzy Soliman:
  Subgradient optimization applied to a discrete nonlinear problem in engineering design. Math. Program. 25(1): 1-12 (1983)
• 
  Jacob Ponstein:
  Comments on the general duality survey by J. Tind and L.A. Wolsey. Math. Program. 25(2): 240-244 (1983)
• 
  Tony J. Van Roy:
  Cross decomposition for mixed integer programming. Math. Program. 25(1): 46-63 (1983)
• 
  Robert B. Schnabel, Philippe L. Toint:
  Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm. Math. Program. 25(1): 125-129 (1983)
• 
  Jean-Jacques Strodiot, Van Hien Nguyen, Norbert Heukemes:
  ε-Optimal solutions in nondifferentiable convex programming and some related questions. Math. Program. 25(3): 307-328 (1983)
• 
  Mukund N. Thapa:
  Optimization of unconstrained functions with sparse Hessian matrices - Quasi-Newton methods. Math. Program. 25(2): 158-182 (1983)
• 
  Yoshitsugu Yamamoto:
  A new variable dimension algorithm for the fixed point problem. Math. Program. 25(3): 329-342 (1983)
• 
  Sanjo Zlobec:
  Characterizing an optimal input in perturbed convex programming. Math. Program. 25(1): 109-121 (1983)