Theoretical convergence of large-step primal—dual interior point algorithms for linear programming Masakazu KojimaNimrod MegiddoShinji Mizuno OriginalPaper Pages: 1 - 21
Determination of optimal vertices from feasible solutions in unimodular linear programming Shinji MizunoRomesh SaigalJames B. Orlin OriginalPaper Pages: 23 - 31
On the convergence of iterative methods for symmetric linear complementarity problems Alfredo N. Iusem OriginalPaper Pages: 33 - 48
Directional differentiability of optimal solutions under Slater's condition S. Dempe OriginalPaper Pages: 49 - 69
Restricted simplicial decomposition for convex constrained problems Jose A. VenturaDonald W. Hearn OriginalPaper Pages: 71 - 85
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks Arie Tamir OriginalPaper Pages: 117 - 132
Combining phase I and phase II in a potential reduction algorithm for linear programming Michael J. Todd OriginalPaper Pages: 133 - 150
A quadratically convergent O(\(\sqrt n \) L)-iteration algorithm for linear programming Y. YeO. GülerY. Zhang OriginalPaper Pages: 151 - 162
Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces Peter GritzmannVictor Klee OriginalPaper Pages: 163 - 213
Conditions for the discovery of solution horizons James C. BeanRobert L. Smith OriginalPaper Pages: 215 - 229
Dual coordinate ascent methods for non-strictly convex minimization Paul Tseng OriginalPaper Pages: 231 - 247
A finite step algorithm via a bimatrix game to a single controller non-zero sum stochastic game A. S. NowakT. E. S. Raghavan OriginalPaper Pages: 249 - 259
On combining feasibility, descent and superlinear convergence in inequality constrained optimization Eliane R. PanierAndré L. Tits OriginalPaper Pages: 261 - 276
Mixed-integer bilinear programming problems Warren P. AdamsHanif D. Sherali OriginalPaper Pages: 279 - 305
TheD 2-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations Chuangyin Dang OriginalPaper Pages: 307 - 324
Convex composite multi-objective nonsmooth programming V. JeyakumarX. Q. Yang OriginalPaper Pages: 325 - 343
An active-set strategy in an interior point method for linear programming Kaoru Tone OriginalPaper Pages: 345 - 360
A little theorem of the bigℳ in interior point algorithms Masakazu KojimaShinji MizunoAkiko Yoshise OriginalPaper Pages: 361 - 375
Hierarchical decomposition of symmetric discrete systems by matroid and group theories Kazuo Murota OriginalPaper Pages: 377 - 404
A note on the prize collecting traveling salesman problem Daniel BienstockMichel X. GoemansDavid Williamson OriginalPaper Pages: 413 - 420