Volume 59,
1993
- Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming.
1-21
- Shinji Mizuno, Romesh Saigal, James B. Orlin:
Determination of optimal vertices from feasible solutions in unimodular linear programming.
23-31
- Alfredo N. Iusem:
On the convergence of iterative methods for symmetric linear complementarity problems.
33-48
- S. Dempe:
Directional differentiability of optimal solutions under Slater's condition.
49-69
- Jose A. Ventura, Donald W. Hearn:
Restricted simplicial decomposition for convex constrained problems.
71-85
- Sunil Chopra, M. R. Rao:
The partition problem.
87-115
- Arie Tamir:
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks.
117-132
- Michael J. Todd:
Combining phase I and phase II in a potential reduction algorithm for linear programming.
133-150
- Yinyu Ye, Osman Güler, Richard A. Tapia, Yin Zhang:
A quadratically convergent O(qudra root(n)*L)-iteration algorithm for linear programming.
151-162
- Peter Gritzmann, Victor Klee:
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces.
163-213
- James C. Bean, Robert L. Smith:
Conditions for the discovery of solution horizons.
215-229
- Paul Tseng:
Dual coordinate ascent methods for non-strictly convex minimization.
231-247
- A. S. Nowak, T. E. S. Raghavan:
A finite step algorithm via a bimatrix game to a single controller non-zero sum stochastic game.
249-259
- Eliane R. Panier, André L. Tits:
On combining feasibility, descent and superlinear convergence in inequality constrained optimization.
261-276
- Warren P. Adams, Hanif D. Sherali:
Mixed-integer bilinear programming problems.
279-305
- Chuangyin Dang:
The D2-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations.
307-324
- Vaithilingam Jeyakumar, Xiaoqi Yang:
Convex composite multi-objective nonsmooth programming.
325-343
- Kaoru Tone:
An active-set strategy in an interior point method for linear programming.
345-360
- Masakazu Kojima, Shinji Mizuno, Akiko Yoshise:
A little theorem of the big Mu in interior point algorithms.
361-375
- Kazuo Murota:
Hierarchical decomposition of symmetric discrete systems by matroid and group theories.
377-404
- Livinus Ugochukwu Uko:
Remarks on the generalized Newton method.
405-412
- Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David P. Williamson:
A note on the prize collecting traveling salesman problem.
413-420
Copyright © Mon Nov 2 21:48:21 2009
by Michael Ley (ley@uni-trier.de)
