Volume 79,
1997
- Alfred Auslender:
How to deal with the unbounded in optimization: Theory and algorithms.
3-18
- Egon Balas:
A modified lift-and-project procedure.
19-31
- Alexander I. Barvinok:
Measure concentration in optimization.
33-53
- Rainer E. Burkard:
Efficiently solvable special cases of hard combinatorial optimization problems.
55-69
- Gunnar Brinkmann, Andreas W. M. Dress, Sören Perrey, Jens Stoye:
Two applications of the Divide&Conquer principle in the molecular sciences.
71-97
- Arne Stolbjerg Drud:
Interactions between nonlinear programming and modeling systems.
99-123
- Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida:
Algorithms for railway crew management.
125-141
- Michel X. Goemans:
Semidefinite programming in combinatorial optimization.
143-161
- Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Logical analysis of numerical data.
163-190
- Pierre Hansen, Brigitte Jaumard:
Cluster analysis and mathematical programming.
191-215
- Gil Kalai:
Linear programming, the simplex algorithm and simple polytopes.
217-233
- Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata:
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming.
235-253
- Monique Laurent:
Cuts, matrix completions and graph rigidity.
255-283
- Yurii Nesterov:
Interior-point methods: An old and new approach to nonlinear programming.
285-297
- Jong-Shi Pang:
Error bounds in mathematical programming.
299-332
- Andrzej Ruszczynski:
Decomposition methods in stochastic programming.
333-353
- Herbert E. Scarf:
Test sets for integer programs.
355-368
- Komei Fukuda, Tamás Terlaky:
Criss-cross methods: A fresh view on pivot algorithms.
369-395
- Andrew R. Conn, Katya Scheinberg, Philippe L. Toint:
Recent progress in unconstrained nonlinear optimization without derivatives.
397-414
- Michael R. Bussieck, Thomas Winter, Uwe Zimmermann:
Discrete optimization in public rail transport.
415-444
- Jochem Zowe, Michal Kocvara, Martin P. Bendsøe:
Free material optimization via mathematical programming.
445-466
Copyright © Fri Dec 4 20:34:02 2009
by Michael Ley (ley@uni-trier.de)
