default search action
Mathematical Programming, Volume 60
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
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 - Michel 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
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
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 - Ludwig Kuntz
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
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-04-07 23:50 CEST 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: