Kniha Computational Combinatorial Optimization Michael Jünger

Computational Combinatorial Optimization

Optimal or Provably Near-Optimal Solutions

Jazyk: Angličtina
Vazba: Brožovaná
Dostupnost: Skladem u dodavatele
Odesíláme za 5-8 dnů
1 147
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimizatio...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2001
Stránek
310
EAN
9783540428770
ISBN
3540428771
Enbook ID
01563928
Hmotnost
1000
Rozměry
216 x 279 x 18

Kompletní popis

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.

Mohlo by vás zajímat

Playful Parenting

Lawrence J. Cohen
348
355

Dark Highway

Dan Kenyon
217

Word Hero

Jay Heinrichs
380

Advances in Quantum Phenomena

Enrico G. Beltrametti
1 147
3 426

Zákaznicí kteří koupili tuto knihu koupili také

518

Sartre über Sartre

Traugott König
202
1 151

Kouzlení vše nezmění

Helena Beránková
154
478