Volume 60,
1993
- Paul Tseng, Dimitri P. Bertsekas:
On the convergence of the exponential multiplier method for convex programming.
1-19
- Gérard Cornuéjols, Farid Harche:
Polyhedral study of the capacitated vehicle routing problem.
21-52
- Francisco Barahona:
On cuts and matchings in planar graphs.
53-68
- Jie Sun:
A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions.
69-79
- Jean-Louis Goffin, Jean-Philippe Vial:
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm.
81-92
- J. E. Martínez-Legaz, S. Romano-Rodríguez:
Lower subdifferentiability of quadratic functions.
93-113
- Donald K. Wagner, Hong Wan:
A polynomial-time simplex method for the maximum k-flow problem.
115-123
- M. L. Balinski, Fred J. Rispoli:
Signature classes of transportation polytopes.
127-144
- Michel X. Goemans, Dimitris Bertsimas:
Survivable networks, linear programming relaxations and the parsimonious property.
145-166
- Dirk Siegel:
Updating of conjugate direction matrices using members of Broyen's family.
167-185
- Gianni Di Pillo, Luigi Grippo, Stefano Lucidi:
A smooth method for the finite minimax problem.
187-214
- Osman Güler, Yinyu Ye:
Convergence behavior of interior-point algorithms.
215-228
- Jiri Rohn:
A note on solvability of a class of linear complementarity problems.
229-231
- Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani:
The convex hull of two core capacitated network design problems.
233-250
- James B. Orlin, Serge A. Plotkin, Éva Tardos:
Polynomial dual network simplex algorithms.
255-276
- Alexander V. Karzanov, Vasilij N. Lebedev:
Cyclical games with prohibitions.
277-293
- Jong-Shi Pang, Steven A. Gabriel:
NE/SQP: A robust algorithm for the nonlinear complementarity problem.
295-337
- L. Kuntz, Stefan Scholtes:
Constraint qualifications in quasidifferentiable optimization.
339-347
- Michael M. Kostreva, Malgorzata M. Wiecek:
Linear complementarity problems and multiple objective programming.
349-359
- Olaf E. Flippo, Alexander H. G. Rinnooy Kan:
Decomposition in general mathematical programming.
361-382
Copyright © Wed Dec 9 20:25:25 2009
by Michael Ley (ley@uni-trier.de)
