Volume 77,
1997
- N. L. Boland:
A dual-active-set algorithm for positive semi-definite quadratic programming.
1-27
- Sjur Didrik Flåm, Anatoly S. Antipin:
Equilibrium programming using proximal-like algorithms.
29-41
- Tomasz Radzik:
Fast deterministic approximation for the multicommodity flow problem.
43-58
- Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra.
59-84
- Yinyu Ye:
Complexity analysis of the analytic center cutting plane method that uses multiple cuts.
85-104
- James B. Orlin:
A polynomial time primal network simplex algorithm for minimum cost flows.
109-129
- Ronald D. Armstrong, Zhiying Jin:
A new strongly polynomial dual network simplex algorithm.
131-148
- P. T. Sokkalingam, Prabha Sharma, Ravindra K. Ahuja:
A new pivot selection rule for the network simplex algorithm.
149-158
- Donald Goldfarb, Wei Chen:
On strongly polynomial dual simplex algorithms for the maximum flow problem.
159-168
- Robert Endre Tarjan:
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm.
169-177
- S. Thomas McCormick:
How to compute least infeasible flows.
179-194
- Riccardo Cambini, Giorgio Gallo, Maria Grazia Scutellà:
Flows on hypergraphs.
195-217
- Alexander V. Karzanov:
Multiflows and disjoint paths of minimum total cost.
219-242
- Lorenzo Brunetta, Michele Conforti, Giovanni Rinaldi:
A branch-and-cut algorithm for the equicut problem.
243-263
- Martin Grötschel, Alexander Martin, Robert Weismantel:
The Steiner tree packing problem in VLSI design.
265-281
- Jonathan Yackel, Robert R. Meyer, Ioannis T. Christou:
Minimum-perimeter domain assignment.
283-303
- Jean-Pierre Crouzeix:
Pseudomonotone variational inequality problems: Existence of solutions.
305-314
- Benjamin Jansen, Kees Roos, Tamás Terlaky, Akiko Yoshise:
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems.
315-345
- Ji-Ming Peng:
Equivalence of variational inequality problems to unconstrained minimization.
347-355
- Mordechai I. Henig, John T. Buchanan:
Tradeoff directions in multiobjective optimization problems.
357-374
- Luigi Grippo, Stefano Lucidi:
A globally convergent version of the Polak-Ribière conjugate gradient method.
375-391
- Renato D. C. Monteiro, Paulo R. Zanjácomo:
A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming.
393-396
Copyright © Tue Dec 1 16:35:11 2009
by Michael Ley (ley@uni-trier.de)
