Combinatorial Optimization Theory and Algorithms /

• Main Authors: Korte, Bernhard (Author), Vygen, Jens (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Edition: Fourth Edition.
• Series: Algorithms and Combinatorics, 21
• Subjects: Mathematics.; Operations research.; Decision making.; Computer science > Mathematics.; Mathematical models.; Calculus of variations.; Discrete mathematics.; Combinatorics.; Discrete Mathematics.; Mathematical Modeling and Industrial Mathematics.; Calculus of Variations and Optimal Control; Optimization.; Mathematics of Computing.; Operation Research/Decision Theory.

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It...

Table of Contents:

• Graphs
• Linear Programming
• Linear Programming Algorithms
• Integer Programming
• Spanning Trees and Arborescences
• Shortest Paths
• Network Flows
• Minimum Cost Flows
• Maximum Matchings
• Weighted Matching
• b-Matchings and T-Joins
• Matroids
• Generalizations of Matroids
• NP-Completeness
• Approximation Algorithms
• The Knapsack Problem
• Bin-Packing
• Multicommodity Flows and Edge-Disjoint Paths
• Network Design Problems
• The Traveling Salesman Problem
• Facility Location.