You might also like

More about Computational Combinatorial Optimization

• Book details
• Synopsis
• Trending among others

You get 125 loyalty points

Book synopsis

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.

Book details

Book category Knihy po anglicky Mathematics & science Mathematics Optimization

• Full title: Computational Combinatorial Optimization
• Subtitle: Optimal or Provably Near-Optimal Solutions
• Author: Michael Jünger, Denis Naddef
• Language: English
• Binding: Paperback
• Number of pages: 310
• EAN: 9783540428770
• ISBN: 3540428771
• ID: 01563928
• Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Weight: 1000 g
• Dimensions: 279 × 216 × 18 mm
• Date of publishing: 21. November 2001

Trending among others

---

---

---