Computational Combinatorial Optimization

Beschreibung

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.
Includes supplementary material: sn.pub/extras

Autor*in

Michael Jünger

Themen in »Computational Combinatorial Optimization«

Branch and Cut Algorithms Combinatorial Optimization Computational Combinatorial Optimization Discrete Computations Discrete Structures Optimization Algorithms Polyhedral Combinatorics Traveling Salesman Problem (TSP) algorithms modeling optimization programming algorithm analysis and problem complexity data structures combinatorics

Stimmen zu »Computational Combinatorial Optimization«

Details

Link teilen