Computational Combinatorial Optimization
Subtitle: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science)
Contributors: Michael Jünger (Editor); Denis Naddef (Editor)
Edition: 1 edition
Publisher: Springer
Published: December 18, 2001
Language: eng
Format: Paperback
Number of pages: 305
ISBN-13: 9783540428770
Subjects: Optimization; Programming - General; General; Computer Programming; Optimization (Mathematical Theory); Computers; Mathematics; Programming (Mathematics); Science/Mathematics; Linear Programming; Computer Science; Mathematics / Discrete Mathematics; Combinatorial optimization; Congresses
First sentence: A general mixed integer program (MIP) is the problem of optimizing a linear objective function subject to a system of linear constraints, where some or all of the variables are required to be integer.
Description: 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.