The chapters of this Handbook volume cover nine main topics that are representative of recent theoretical and algorithmic developments in the field. In addition to the nine papers that present the state of the art, there is an article on the early history of the field.
The handbook will be a useful reference to experts in the field as well as students and others who want to learn about discrete optimization.
1. On the History of Combinatorial Optimization (till 1960) (A. Schrijver). 2. Computational Integer Programming and Cutting Planes (A. F??genschuh, A. Martin). 3. The Structure of Group Relaxations (R. R. Thomas). 4. Integer programming, lattices, and results in fixed dimension (K. Aardal, F. Eisenbrand). 5. Primal Integer Programming (B. Spille, R. Weismantel). 6. Balanced Matrices (G. Cornu??jols, M. Conforti). 7. Submodular Function Minimization (T. McCormick). 8. Semidefinite Programming and Integer Programming (M. Laurent, F. Rendl). 9. Algorithms for Stochastic Mixed-Integer Programming Models (S. Sen). 10. Constraint Programming (A. Bockmayr, J.N. Hooker).
Published: 8th December 2005
Publisher: Elsevier Science