Mohlo by se vám také líbit

Více informací o knize Computational Combinatorial Optimization

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 118 bodů

Anotace 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.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Optimization

• Plný název: Computational Combinatorial Optimization
• Podnázev: Optimal or Provably Near-Optimal Solutions
• Autor: Michael Jünger, Denis Naddef
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 310
• EAN: 9783540428770
• ISBN: 3540428771
• ID: 01563928
• Nakladatelství: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Hmotnost: 1000 g
• Rozměry: 279 × 216 × 18 mm
• Datum vydání: 21. November 2001

Oblíbené z jiného soudku

---

---

---