This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Format:Hardcover
Language:English
ISBN:3540443894
ISBN13:9783540443896
Release Date:December 2002
Publisher:Springer
Length:1879 Pages
Weight:7.00 lbs.
Dimensions:3.9" x 6.5" x 10.5"
Recommended
Format: Hardcover
Condition: New
$159.99
On Backorder
If the item is not restocked at the end of 90 days, we will cancel your backorder and issue you a refund.
ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.