You have Guest access.
Log In
Volume 1 / 1971 - Volume 131 / 2012
1-16
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
Martin Dyer and Alan Frieze
17-51
Dynamic factorization in large-scale optimization
Gerald G. Brown and Michael P. Olson
53-79
A class of gap functions for variational inequalities
Torbjörn Larsson and Michael Patriksson
81-101
A proximal-based decomposition method for convex minimization problems
Gong Chen and Marc Teboulle
103-122
A continuous deformation algorithm for variational inequality problems on polytopes
Yang Dai and Yoshitsugu Yamamoto
123-147
A globally convergent primal—dual interior point algorithm for convex programming
Renato D. C. Monteiro
149-171
A row-action method for convex programming
Alfredo N. Iusem and B. F. Svaiter
173-178
The P-matrix problem is co-NP-complete
Gregory E. Coxson
179-197
A criterion for time aggregation in intertemporal dynamic models
Jean Mercenier and Philippe Michel
199-208
Two-edge connected spanning subgraphs and polyhedra
Ali Ridha Mahjoub
209-229
The Steiner tree problem I: Formulations, compositions and extension of facets
Sunil Chopra and M. R. Rao
231-246
The Steiner tree problem II: Properties and classes of facets
247
Notice
Preliminary announcement
249-276
On the solution of a two ball trust region subproblem
M. Heinkenschloss
277-294
Superlinearly convergent approximate Newton methods for LC1 optimization problems
Liqun Qi
295-323
Near-perfect matrices
F. B. Shepherd
325-336
New algorithms for generalized network flows
Edith Cohen and Nimrod Megiddo
337-363
Relaxation-based algorithms for minimax optimization problems with resource allocation applications
Rachelle S. Klein, Hanan Luss and Uriel G. Rothblum
365-370
On extremal behaviors of Murty's least index method
Komei Fukuda and Makoto Namiki
371-373
Referees 1993
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info