Combinatorial optimization
Subtitle: polyhedra and efficiency
By: Alexander Schrijver
Series: Algorithms and combinatorics -- 24
Publisher: Springer
Published: 2003
Place of publication: Berlin; New York
Language: eng
Number of pages: 1881
Subjects: Combinatorial optimization
Description: An in-depth overview of polyhedral methods and efficient algorithms incombinatorial 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 thebasic subjects are presented.
Notes: Includes bibliographical references (p. [1463]-1766) and indexes
Table of contents: title: v. A. Paths, flows, matchings; title: v. B. Matroids, trees, stable sets; title: v. C. Disjoint paths, hypergraphs