✍ Scribed by Jünger, Michael; Naddef, Denis
No coin nor oath required. For personal study only.
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.
📜 SIMILAR VOLUMES
Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (MPS) in the late 1980s. Thus IPCO was born, and MPS has sponsored the conference as one of its main events since IPCO I at the Universit
This Book Is Dedicated To Jack Edmonds In Appreciation Of His Ground Breaking Work That Laid The Foundations For A Broad Variety Of Subsequent Results Achieved In Combinatorial Optimization.the Main Part Consists Of 13 Revised Full Papers On Current Topics In Combinatorial Optimization, Presented At