Könyv Computational Combinatorial Optimization Michael Jünger

Computational Combinatorial Optimization

Optimal or Provably Near-Optimal Solutions

Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: Beszállítói készleten
Küldés 5-8 napon belül
19 305 Ft
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimizatio...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2001
oldal
310
EAN
9783540428770
ISBN
3540428771
Enbook ID
01563928
Súly
1000
Méretek
216 x 279 x 18

Teljes leírás

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.

Érdekelheti

Playful Parenting

Lawrence J. Cohen
5 985 Ft
5 205 Ft

Dark Highway

Dan Kenyon
3 739 Ft

Word Hero

Jay Heinrichs
6 456 Ft

Advances in Quantum Phenomena

Enrico G. Beltrametti
19 305 Ft
57 690 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

7 590 Ft

Sartre über Sartre

Traugott König
3 439 Ft
19 435 Ft

Kouzlení vše nezmění

Helena Beránková
2 318 Ft
7 007 Ft