Cover Image
Read Now

Combinatorial Optimization Theory and Algorithms

Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. It became a subject in its own right about 50 years ago. This book describes the most important ideas, theoretical results, and algo­ rithms in combinatorial opti...

Full description

Bibliographic Details
Main Authors: Korte, Bernhard, Vygen, Jens (Author)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2000, 2000
Edition:1st ed. 2000
Series:Algorithms and Combinatorics
Subjects:
Mathematics Of Computing
Computer Science / Mathematics
Calculus Of Variations And Optimization
Discrete Mathematics
Mathematical Optimization
Calculus Of Variations
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • 1. Introduction
  • 2. Graphs
  • 3. Linear Programming
  • 4. Linear Programming Algorithms
  • 5. Integer Programming
  • 6. Spanning Trees and Arborescences
  • 7. Shortest Paths
  • 8. Network Flows
  • 9. Minimum Cost Flows
  • 10. Maximum Matchings
  • 11. Weighted Matching
  • 12. b-Matchings and T-Joins
  • 13. Matroids
  • 14. Generalizations of Matroids
  • 15. NP-Completeness
  • 16. Approximation Algorithms
  • 17. The Knapsack Problem
  • 18. Bin-Packing
  • 19. Multicommodity Flows and Edge-Disjoint Paths
  • 20. Network Design Problems
  • 21. The Traveling Salesman Problem
  • Notation Index
  • Author Index

Similar Items