![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Mathematical Programming, Volume 64
Volume 64, 1994
- Martin E. Dyer
, Alan M. Frieze
:
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. 1-16 - Gerald G. Brown, Michael P. Olson:
Dynamic factorization in large-scale optimization. 17-51 - Torbjörn Larsson
, Michael Patriksson
:
A class of gap functions for variational inequalities. 53-79 - Gong Chen, Marc Teboulle:
A proximal-based decomposition method for convex minimization problems. 81-101 - Yang Dai, Yoshitsugu Yamamoto:
A continuous deformation algorithm for variational inequality problems on polytopes. 103-122 - Renato D. C. Monteiro:
A globally convergent primal-dual interior point algorithm for convex programming. 123-147 - Alfredo N. Iusem, Benar Fux Svaiter
:
A row-action method for convex programming. 149-171 - Gregory Emmett Coxson:
The P-matrix problem is co-NP-complete. 173-178 - Jean Mercenier, Philippe Michel:
A criterion for time aggregation in intertemporal dynamic models. 179-197 - Ali Ridha Mahjoub:
Two-edge connected spanning subgraphs and polyhedra. 199-208 - Sunil Chopra
, M. R. Rao:
The Steiner tree problem I: Formulations, compositions and extension of facets. 209-229 - Sunil Chopra
, M. R. Rao:
The Steiner tree problem II: Properties and classes of facets. 231-246 - Matthias Heinkenschloss
:
On the solution of a two ball trust region subproblem. 249-276 - Liqun Qi
:
Superlinearly convergent approximate Newton methods for LC optimization problems. 277-294 - F. Bruce Shepherd:
Near-perfect matrices. 295-323 - Edith Cohen, Nimrod Megiddo:
New algorithms for generalized network flows. 325-336 - Rachelle S. Klein, Hanan Luss, Uriel G. Rothblum:
Relaxation-based algorithms for minimax optimization problems with resource allocation applications. 337-363 - Komei Fukuda, Makoto Namiki:
On extremal behaviors of Murty's least index method. 365-370
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.