Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics) : Polyhedra and Efficiency

Alexander Schrijver

ISBN 10: 3540443894 / ISBN 13: 9783540443896

Published by Springer Berlin Heidelberg, 2002

About this Item

Gebraucht - Sehr gut achtung: nur band b!!! volume b only!!! - leichte beschädigungen oder verschmutzungen, ungelesenes mängelexemplar, gestempelt - 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.

Seller Inventory # INF1000399609

Bibliographic Details

• Title: Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics) : Polyhedra and Efficiency
• Publisher: Springer Berlin Heidelberg
• Publication Date: 2002
• Language: English
• ISBN 10: 3540443894
• ISBN 13: 9783540443896
• Binding: Gebundene Ausgabe
• Condition: Sehr gut

About this title

Synopsis

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.

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".