Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics #24) By Alexander Schrijver Cover Image

Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics #24) (Hardcover)

Not available


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.

About the Author

Alexander Schrijver is one of the most respected researchers in this area. He has won the Dantzig award, the Fulkerson prize (twice) and the Lanchester Prize for his earlier classic text on "Theory of Linear and Integer Programming".

Product Details
ISBN: 9783540443896
ISBN-10: 3540443894
Publisher: Springer
Publication Date: December 10th, 2002
Pages: 1879
Language: English
Series: Algorithms and Combinatorics