1. Lectures on mathematical programming ismp97

   • Thomas M. Liebling
   • Dominique de Werra

   Preface Pages: 1 - 2

2. How to deal with the unbounded in optimization: Theory and algorithms

   • A. Auslender

   OriginalPaper Pages: 3 - 18

3. A modified lift-and-project procedure

   • Egon Balas

   OriginalPaper Pages: 19 - 31

4. Measure concentration in optimization

   • Alexander Barvinok

   OriginalPaper Pages: 33 - 53

5. Efficiently solvable special cases of hard combinatorial optimization problems

   • Rainer E. Burkard

   OriginalPaper Pages: 55 - 69

6. Two applications of the divide&conquer principle in the molecular sciences

   • G. Brinkmann
   • A. W. M. Dress
   • J. Stoye

   OriginalPaper Pages: 71 - 97

7. Interactions between nonlinear programming and modeling systems

   • Arne Stolbjerg Drud

   OriginalPaper Pages: 99 - 123

8. Algorithms for railway crew management

   • Alberto Caprara
   • Matteo Fischetti
   • Pier Luigi Guida

   OriginalPaper Pages: 125 - 141

9. Semidefinite programming in combinatorial optimization

   • Michel X. Goemans

   OriginalPaper Pages: 143 - 161

10. Logical analysis of numerical data

    • Endre Boros
    • Peter L. Hammer
    • Alexander Kogan

    OriginalPaper Pages: 163 - 190

11. Cluster analysis and mathematical programming

    • Pierre Hansen
    • Brigitte Jaumard

    OriginalPaper Pages: 191 - 215

12. Linear programming, the simplex algorithm and simple polytopes

    • Gil Kalai

    OriginalPaper Pages: 217 - 233

13. Exploiting sparsity in primal-dual interior-point methods for semidefinite programming

    • Katsuki Fujisawa
    • Masakazu Kojima
    • Kazuhide Nakata

    OriginalPaper Pages: 235 - 253

14. Cuts, matrix completions and graph rigidity

    • Monique Laurent

    OriginalPaper Pages: 255 - 283

15. Interior-point methods: An old and new approach to nonlinear programming

    • Yu. Nesterov

    OriginalPaper Pages: 285 - 297

16. Error bounds in mathematical programming

    • Jong-Shi Pang

    OriginalPaper Pages: 299 - 332

17. Decomposition methods in stochastic programming

    • Andrzej Ruszczyński

    OriginalPaper Pages: 333 - 353

18. Test sets for integer programs

    • Herbert E. Scarf

    OriginalPaper Pages: 355 - 368

19. Criss-cross methods: A fresh view on pivot algorithms

    • Komei Fukuda
    • Tamás Terlaky

    OriginalPaper Pages: 369 - 395

20. Recent progress in unconstrained nonlinear optimization without derivatives

    • A. R. Conn
    • K. Scheinberg
    • Ph. L. Toint

    OriginalPaper Pages: 397 - 414

21. Discrete optimization in public rail transport

    • M. R. Bussieck
    • T. Winter
    • U. T. Zimmermann

    OriginalPaper Pages: 415 - 444

22. Free material optimization via mathematical programming

    • Jochem Zowe
    • Michal Kočvara
    • Martin P. Bendsøe

    OriginalPaper Pages: 445 - 466