AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Combinatorial Optimization
About this Title
William J Cook, Rice University, Houston, TX, Laszlo Lovasz, Yale University, New Haven, CT and Paul Seymour, Bellcore, Morristown, NJ, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1995; Volume 20
ISBNs: 978-0-8218-0239-7 (print); 978-1-4704-3978-1 (online)
DOI: https://doi.org/10.1090/dimacs/020
MathSciNet review: MR1338611
MSC: Primary 90-06; Secondary 05-06, 90C10, 90C27
Table of Contents
Front/Back Matter
Chapters
- Hypermetrics in geometry of numbers
- Practical problem solving with cutting plane algorithms in combinatorial optimization
- Randomized algorithms in combinatorial optimization
- Maximum cuts and large bipartite subgraphs
- Algorithms and reformulations for lot sizing problems
- Efficient algorithms for disjoint paths in planar graphs
- Computing near-optimal solutions to combinatorial optimization problems
- Graph entropy: A survey