Combinatorial Optimization

Polyhedra and Efficiency
1. Auflage 2004
ISBN: 978-3-540-20456-5
Verlag: Springer

Sonstiges, Englisch, Band 24/A, 1882 Seiten, Compact disk (CD-ROM), Format (B × H): 155 mm x 235 mm, Gewicht: 100 g

Reihe: Algorithms and Combinatorics

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.

Zielgruppe

Research

Autoren/Hrsg.

Schrijver, Alexander

Inhaltsverzeichnis

Introduction.- Paths and Flows.- Bipartite Matching and Covering.- Nonbipartite Matching and Covering.- Matroids and Submodular Functions.- Trees, Branchings, and Connectors.- Cliques, Stable Sets and Colouring.- Multiflows and Disjoint Paths.- Hypergraphs.- Survey of Problems, Questions and Conjectures.- References.- Name Index.- Subject Index.

Über Autor(innen)

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