Title: Computational combinatorial optimization : optimal or provably near-optimal solutions /
Authors: Jünger, M.; Naddef, Denis, 1947-
Publisher: Springer,
Year: 2001
Subjects: Programming (Mathematics) Congresses.; Combinatorial optimization Congresses.; Computer science.; Data structures (Computer science).; Computer software.; Electronic data processing.; Computational complexity.; Combinatorial analysis.; Management information systems.
Abstract: Publisher description: This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.
Contents: General mixed integer programming : computational issues for branch-and-cut algorithms / Alexander Martin -- Projection and lifting in combinatorial optimization / Egon Balas -- Mathematical programming models and formulations for deterministic production planning problems / Yves Pochet -- Lagrangian relaxation / Claude Lemaréchal -- Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS / Matthias Elf [and others] -- Branch, cut, and price : sequential and parallel / Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter, Jr. -- TSP cuts which do not conform to the template paradigm / David Applegate, Robert Bixby, Vašek Chvátal.