Mohlo by sa vám tiež páčiť

Viac informácií o knihe Computational Combinatorial Optimization

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 125 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Optimization

• Celý názov: Computational Combinatorial Optimization
• Podnázov: Optimal or Provably Near-Optimal Solutions
• Autor: Michael Jünger, Denis Naddef
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 310
• EAN: 9783540428770
• ISBN: 3540428771
• ID: 01563928
• Nakladateľ: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Hmotnosť: 1000 g
• Rozmery: 279 × 216 × 18 mm
• Dátum vydania: 21. November 2001

Obľúbené z iného súdka

---

---

---