Journal: Math. Program.

Volume 37, Issue 3

255 -- 267Satoru Hashizume, Masao Fukushima, Naoki Katoh, Toshihide Ibaraki. Approximation algorithms for combinatorial fractional programming problems
269 -- 292Eliane R. Panier. An active set method for solving linearly constrained nonsmooth optimization problems
293 -- 308M. J. M. Jansen, S. H. Tijs. Robustness and nondegenerateness for linear complementarity problems
309 -- 317Ellen Allen, Richard V. Helgason, Jeffery L. Kennington, Bala Shetty. A generalization of Polyak's convergence result for subgradient optimization
319 -- 355T. M. Doup, A. J. J. Talman. A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
357 -- 360S. H. Lu, A. C. Williams. Roof duality for polynomial 0-1 optimization

Volume 37, Issue 2

131 -- 152Marie-Cécile Noël, Yves Smeers. Nested decomposition of multistage nonlinear programs with recourse
153 -- 168Peter Kleinschmidt, Carl W. Lee, Heinz Schannath. Transportation problems which can be solved by the use of hirsch-paths for the dual problems
169 -- 183Suvrajeet Sen, Hanif D. Sherali. Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
184 -- 207H. C. P. Berbee, C. G. E. Boender, A. H. G. Rinnooy Kan, C. L. Scheffer, Robert L. Smith, Jan Telgen. Hit-and-run algorithms for the identification of nonredundant linear inequalities
208 -- 222Stephen M. Robinson. Local epi-continuity and local optimization
223 -- 231Muhamed Aganagic, Richard W. Cottle. o-matrices with nonnegative principal minors
232 -- 252Stephen J. Wright. Local properties of inexact methods for minimizing nonsmooth composite functions
254 -- 0Bernd Jeromin, Frank Körner. On the refinement of bounds of heuristics algorithms of the traveling salesman poblem

Volume 37, Issue 1

1 -- 18Lars Mathiesen. An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
19 -- 40Andrew R. Conn, Nicholas I. M. Gould. An exact penalty function for semi-infinite programming
41 -- 50Dominique de Werra. Partitions into odd chains
51 -- 58M. A. Hanson, B. Mond. Necessary and sufficient conditions in constrained optimization
59 -- 80C. G. E. Boender, A. H. G. Rinnooy Kan. Bayesian stopping rules for multistart global optimization methods
81 -- 90David M. Gay. A variant of Karmarkar's linear programming algorithm for problems in standard form
91 -- 116Stanislaw M. Grzegórski. Multilevel least-change Newton-like methods for equality constrained optimization problems
117 -- 120Matteo Fischetti, Silvano Martello. Worst-case analysis of the differencing method for the partition problem