Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions

Naddef, Denis
Jünger, Michael

Paperback

Series: Lecture Notes in Computer Science, Book 2241

Medical ReferenceGeneral ComputersGeneral Mathematics

ISBN10: 3540428771
ISBN13: 9783540428770
Publisher: Springer
Published: Nov 21 2001
Pages: 310
Weight: 0.99
Height: 0.67 Width: 6.14 Depth: 9.21
Language: English
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.

Also from

Jünger, Michael

View All

Also in

General Mathematics

View All