A polynomial-time algorithm for a class of linear complementarity problems Masakazu KojimaShinji MizunoAkiko Yoshise OriginalPaper Pages: 1 - 26
Interior path following primal-dual algorithms. part I: Linear programming Renato D. C. MonteiroIlan Adler OriginalPaper Pages: 27 - 41
Interior path following primal-dual algorithms. part II: Convex quadratic programming Renato D. C. MonteiroIlan Adler OriginalPaper Pages: 43 - 66
On strongly degenerate complementary cones and solution rays N. EagambaramS. R. Mohan OriginalPaper Pages: 77 - 83
Quadratically constrained minimum cross-entropy analysis S. C. FangJ. R. Rajasekera OriginalPaper Pages: 85 - 96
A constructive proof of a permutation-based generalization of Sperner's lemma R. B. Bapat OriginalPaper Pages: 113 - 120
Directional derivatives for the value-function in semi-infinite programming P. ZenckeR. Hettich Notice Pages: 121 - 121
Experiments in quadratic 0–1 programming F. BarahonaM. JüngerG. Reinelt OriginalPaper Pages: 127 - 137
Recognition problems for special classes of polynomials in 0–1 variables Yves Crama OriginalPaper Pages: 139 - 155
An extension of Karmarkar's projective algorithm for convex quadratic programming Yinyu YeEdison Tse OriginalPaper Pages: 157 - 179
A randomized algorithm for fixed-dimensional linear programming M. E. DyerA. M. Frieze OriginalPaper Pages: 203 - 212
A probabilistic analysis of the switching algorithm for the euclidean TSP Walter Kern OriginalPaper Pages: 213 - 219
An inexact algorithm for composite nondifferentiable optimization Stephen Wright OriginalPaper Pages: 221 - 234
An extension of the simplex algorithm for semi-infinite linear programming E. J. AndersonA. S. Lewis OriginalPaper Pages: 247 - 269
Valid inequalities and facets of the capacitated plant location problem Janny M. Y. LeungThomas L. Magnanti OriginalPaper Pages: 271 - 291
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem R. ChandrasekaranA. Tamir OriginalPaper Pages: 293 - 295
An implementation of Karmarkar's algorithm for linear programming Ilan AdlerMauricio G. C. ResendeNarendra Karmarkar OriginalPaper Pages: 297 - 335
Sequential convexification in reverse convex and disjunctive programming Egon BalasJoseph M. TamaJørgen Tind OriginalPaper Pages: 337 - 350
Global convergence of Rosen's gradient projection method Ding-Zhu DuXiang-Sun Zhang OriginalPaper Pages: 357 - 366
