Containing and shrinking ellipsoids in the path-following algorithm Yinyu YeMichael J. Todd OriginalPaper Pages: 1 - 9
An efficient algorithm for the minimum capacity cut problem M. PadbergG. Rinaldi OriginalPaper Pages: 19 - 36
On the convergence properties of Hildreth's quadratic programming algorithm Alfredo N. IusemAlvaro R. De Pierro OriginalPaper Pages: 37 - 51
On a subproblem of trust region algorithms for constrained optimization Y. Yuan OriginalPaper Pages: 53 - 63
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges Roland Durier OriginalPaper Pages: 65 - 79
Solving the linear matroid parity problem as a sequence of matroid intersection problems James B. OrlinJohn H. Vande Vate OriginalPaper Pages: 81 - 106
A bifurcation analysis of the nonlinear parametric programming problem C. A. TiahrtA. B. Poore OriginalPaper Pages: 117 - 141
A note on the continuity of solutions of parametric linear programs Xiang-Sun ZhangDe-Gang Liu OriginalPaper Pages: 143 - 153
Chvátal closures for mixed integer programming problems W. CookR. KannanA. Schrijver OriginalPaper Pages: 155 - 174
An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations Pravin M. Vaidya OriginalPaper Pages: 175 - 201
Approximate subdifferential and metric regularity: The finite-dimensional case A. JouraniL. Thibault OriginalPaper Pages: 203 - 218
Facet identification for the symmetric traveling salesman polytope Manfred PadbergGiovanni Rinaldi OriginalPaper Pages: 219 - 257
Some proximity and sensitivity results in quadratic integer programming Frieda GranotJadranka Skorin-Kapov OriginalPaper Pages: 259 - 268
Announcement by the Mathematical Programming Society of the A.W. Tucker Prize Notice Pages: 303 - 303
Convergence properties of trust region methods for linear and convex constraints James V. BurkeJorge J. MoréGerardo Toraldo OriginalPaper Pages: 305 - 336
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm Kurt M. Anstreicher OriginalPaper Pages: 337 - 351
A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time Donald GoldfarbJianxiu Hao OriginalPaper Pages: 353 - 365
General constraint qualifications in nondifferentiable programming R. R. MerkovskyD. E. Ward OriginalPaper Pages: 389 - 405
Mslip: A computer code for the multistage stochastic linear programming problem Horand I. Gassmann OriginalPaper Pages: 407 - 423
Active set algorithms for isotonic regression; A unifying framework Michael J. BestNilotpal Chakravarti OriginalPaper Pages: 425 - 439
