default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 37
Volume 37, Number 1, February 1987
- Lars Mathiesen:
An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example. 1-18 - Andrew R. Conn, Nicholas I. M. Gould
:
An exact penalty function for semi-infinite programming. 19-40 - Dominique de Werra:
Partitions into odd chains. 41-50 - Morgan A. Hanson, Bert Mond:
Necessary and sufficient conditions in constrained optimization. 51-58 - C. G. E. Boender, A. H. G. Rinnooy Kan:
Bayesian stopping rules for multistart global optimization methods. 59-80 - David M. Gay:
A variant of Karmarkar's linear programming algorithm for problems in standard form. 81-90 - Stanislaw M. Grzegórski:
Multilevel least-change Newton-like methods for equality constrained optimization problems. 91-116 - Matteo Fischetti, Silvano Martello:
Worst-case analysis of the differencing method for the partition problem. 117-120
Volume 37, Number 2, June 1987
- Marie-Cécile Noël, Yves Smeers:
Nested decomposition of multistage nonlinear programs with recourse. 131-152 - Peter Kleinschmidt, Carl W. Lee, Heinz Schannath:
Transportation problems which can be solved by the use of hirsch-paths for the dual problems. 153-168 - Suvrajeet Sen, Hanif D. Sherali:
Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization. 169-183 - H. 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. 184-207 - Stephen M. Robinson:
Local epi-continuity and local optimization. 208-222 - Muhamed Aganagic, Richard W. Cottle:
A constructive characterization of Qo-matrices with nonnegative principal minors. 223-231 - Stephen J. Wright:
Local properties of inexact methods for minimizing nonsmooth composite functions. 232-252 - Bernd Jeromin, Frank Körner:
On the refinement of bounds of heuristics algorithms of the traveling salesman poblem. 254
Volume 37, Number 3, October 1987
- Satoru Hashizume, Masao Fukushima, Naoki Katoh, Toshihide Ibaraki:
Approximation algorithms for combinatorial fractional programming problems. 255-267 - Eliane R. Panier:
An active set method for solving linearly constrained nonsmooth optimization problems. 269-292 - M. J. M. Jansen, S. H. Tijs:
Robustness and nondegenerateness for linear complementarity problems. 293-308 - Ellen Allen, Richard V. Helgason, Jeffery L. Kennington, Bala Shetty:
A generalization of Polyak's convergence result for subgradient optimization. 309-317 - T. M. Doup, A. J. J. Talman:
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices. 319-355 - S. H. Lu, A. C. Williams:
Roof duality for polynomial 0-1 optimization. 357-360
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-13 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
