## Volume 63,
1994

- D. Burton, Philippe L. Toint:
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs.
1-22
- Dimitris Bertsimas, James B. Orlin:
A technique for speeding up the solution of the Lagrangean dual.
23-45
- J. Scott Provan:
Efficient enumeration of the vertices of polyhedra associated with network LP's.
47-64
- Kelly T. Au, Julia L. Higle, Suvrajeet Sen:
Inexact subgradient methods with applications in stochastic programming.
65-82
- J. B. G. Frenk, Joaquim A. S. Gromicho, Shuzhong Zhang:
A deep cut ellipsoid algorithm for convex programming: Theory and applications.
83-108
- B. M. Glover, Vaithilingam Jeyakumar, W. Oettli:
A Farkas lemma for difference sublinear systems and quasidifferentiable programming.
109-125
- Richard H. Byrd, Jorge Nocedal, Robert B. Schnabel:
Representations of quasi-Newton matrices and their use in limited memory methods.
129-156
- Michel X. Goemans:
The Steiner tree polytope and related polyhedra.
157-182
- François Margot, A. Prodon, Thomas M. Liebling:
Tree polytope on 2-trees.
183-191
- Aharon Ben-Tal, Gideon Eiger, Vladimir Gershovitz:
Global minimization by reducing the duality gap.
193-212
- Ryôhei Nozawa:
Examples of max-flow and min-cut problems with duality gaps in continuous networks.
213-234
- Hans Kremers, Dolf Talman:
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point.
235-252
- Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel:
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
257-279
- Edmund Ihler:
The rectilinear class Steiner tree problem for intervals on two parallel lines.
281-296
- Jun Dong Cho, Majid Sarrafzadeh:
The pin redistribution problem in multi-chip modules.
297-330
- Christine Eisenbeis, William Jalby, Daniel Windheiser, François Bodin:
A strategy for array management in local memory.
331-370
- Shmuel Gal, Yona Hollander, Alon Itai:
Optimal mapping in direct mapped cache environments.
371-387

Copyright © Mon Nov 2 21:48:21 2009
by Michael Ley (ley@uni-trier.de)