Research Catalog

Combinatorial optimization : theory and algorithms

Title
Combinatorial optimization : theory and algorithms / Bernhard Korte, Jens Vygen.
Author
Korte, B. H. (Bernhard H.), 1938-
Publication
Berlin ; New York : Springer, 2000.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextRequest in advance QA402.5 .K6665 2000Off-site

Holdings

Details

Additional Authors
Vygen, Jens
Series Statement
Algorithms and combinatorics, 0937-5511 ; 21
Uniform Title
Algorithms and combinatorics ; 21.
Subject
Combinatorial optimization
Bibliography (note)
  • Includes bibliographical references and index.
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.
ISBN
3540672265 (alk. paper)
LCCN
00032968
OCLC
  • ocm44019408
  • SCSB-3893109
Owning Institutions
Columbia University Libraries