Normal view MARC view ISBD view

Combinatorial optimization : theory and algorithms / Bernhard Korte, Jens Vygen.

By: Korte, B. H. (Bernhard H.), 1938- [author.].
Contributor(s): Vygen, Jens [author.].
Material type: TextTextSeries: Algorithms and combinatorics: 21.Publisher: Berlin, Germany : Springer, 2018Edition: Sixth edition.Description: xxi, 698 pages: E 79.99 illustrations. 24 cms.Content type: text Media type: computer Carrier type: online resourceSubject(s): Combinatorial optimization | Combinatorial optimizationGenre/Form: Electronic books. | Electronic books.DDC classification: 519.6/4
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 -- 22 Facility Location -- Indices.
List(s) this item appears in: 2019-04-30

Includes bibliographical references and indexes.

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 -- 22 Facility Location -- Indices.

Online resource; title from PDF title page (SpringerLink, viewed March 20, 2018).