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 E. 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

last updated on Wed May 22 03:53:11 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page