Combinatorial Optimization : Polyhedra and Efficiency

Alexander Schrijver

ISBN 10: 3540443894 / ISBN 13: 9783540443896

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg, 2002

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - 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.

Codice articolo 9783540443896

Dati bibliografici

• Titolo: Combinatorial Optimization : Polyhedra and Efficiency
• Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg
• Data di pubblicazione: 2002
• Lingua: Inglese
• ISBN 10: 3540443894
• ISBN 13: 9783540443896
• Rilegatura: Buch
• Condizione: Neu

Descrizione articolo

Riassunto

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.

Informazioni sull?autore

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