Volume 64,
1994
- Martin E. Dyer, Alan M. Frieze:
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm.
1-16 BibTeX
- Gerald G. Brown, Michael P. Olson:
Dynamic factorization in large-scale optimization.
17-51 BibTeX
- Torbjörn Larsson, Michael Patriksson:
A class of gap functions for variational inequalities.
53-79 BibTeX
- Gong Chen, Marc Teboulle:
A proximal-based decomposition method for convex minimization problems.
81-101 BibTeX
- Yang Dai, Yoshitsugu Yamamoto:
A continuous deformation algorithm for variational inequality problems on polytopes.
103-122 BibTeX
- Renato D. C. Monteiro:
A globally convergent primal-dual interior point algorithm for convex programming.
123-147 BibTeX
- Alfredo N. Iusem, Benar Fux Svaiter:
A row-action method for convex programming.
149-171 BibTeX
- Gregory E. Coxson:
The P-matrix problem is co-NP-complete.
173-178 BibTeX
- Jean Mercenier, Philippe Michel:
A criterion for time aggregation in intertemporal dynamic models.
179-197 BibTeX
- Ali Ridha Mahjoub:
Two-edge connected spanning subgraphs and polyhedra.
199-208 BibTeX
- Sunil Chopra, M. R. Rao:
The Steiner tree problem I: Formulations, compositions and extension of facets.
209-229 BibTeX
- Sunil Chopra, M. R. Rao:
The Steiner tree problem II: Properties and classes of facets.
231-246 BibTeX
- Matthias Heinkenschloss:
On the solution of a two ball trust region subproblem.
249-276 BibTeX
- Liqun Qi:
Superlinearly convergent approximate Newton methods for LC optimization problems.
277-294 BibTeX
- F. Bruce Shepherd:
Near-perfect matrices.
295-323 BibTeX
- Edith Cohen, Nimrod Megiddo:
New algorithms for generalized network flows.
325-336 BibTeX
- Rachelle S. Klein, Hanan Luss, Uriel G. Rothblum:
Relaxation-based algorithms for minimax optimization problems with resource allocation applications.
337-363 BibTeX
- Komei Fukuda, Makoto Namiki:
On extremal behaviors of Murty's least index method.
365-370 BibTeX
Copyright © Sun May 17 00:14:02 2009
by Michael Ley (ley@uni-trier.de)