menu
{ "item_title" : "Computational Combinatorial Optimization", "item_author" : [" Michael Jünger", "Denis Naddef "], "item_description" : "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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/54/042/877/3540428771_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Computational Combinatorial Optimization|Michael Jünger

Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783540428770
  • ISBN-10: 3540428771
  • Publisher: Springer
  • Publish Date: November 2001
  • Dimensions: 9.21 x 6.14 x 0.67 inches
  • Shipping Weight: 0.99 pounds
  • Page Count: 310

Related Categories

You May Also Like...

    1

BAM Customer Reviews