Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]

General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms.- Projection and Lifting in Combinatorial Optimization.- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems.- Lagrangian Relaxation.- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.- Branch, Cut, and Price: Sequential and Parallel.- TSP Cuts Which Do Not Conform to the Template Paradigm.