.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
. Ed(S): Junger, Michael (Universitat Zu Koln, Germany); Naddef, Dennis
€ 70.58
FREE Delivery in Ireland
Description for Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
paperback. This tutorial contains 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. Editor(s): Junger, Michael (Universitat zu Koln, Germany); Naddef, Dennis. Series: Lecture Notes in Computer Science. Num Pages: 320 pages, biography. BIC Classification: PBU. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 17. Weight in Grams: 451.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
2001
Publisher
Springer Germany
Number of pages
320
Condition
New
Series
Lecture Notes in Computer Science
Number of Pages
310
Place of Publication
Berlin, Germany
ISBN
9783540428770
SKU
V9783540428770
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions