Combinatorial optimization. Theory and algorithms (Q5915844)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6823409
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial optimization. Theory and algorithms |
scientific article; zbMATH DE number 6823409 |
Statements
Combinatorial optimization. Theory and algorithms (English)
0 references
9 January 2018
0 references
This book describes the most important ideas, theoretical results, and algorithms in combinatorial optimization This new sixth edition of the book contains some new material and has the following chapters: Chapter 1: Introduction Chapter 2: Graphs Chapter 3: Linear Programming Chapter 4: Linear Programming Algorithms Chapter 5: Integer Programming Chapter 6: Spanning Trees and Arborescences Chapter 7: Shortest Paths Chapter 8: Network Flows Chapter 9: Minimum Cost Flows Chapter 10: Maximum Matchings Chapter 11: Weighted Matching Chapter 12: b-Matchings and T-Joins Chapter 13: Matroids Chapter 14: Generalizations of Matroids Chapter 15: NP-Completeness Chapter 16: Approximation Algorithms Chapter 17: The Knapsack Problem Chapter 18: Bin-Packing Chapter 19: Multicommodity Flows and Edge-Disjoint Paths Chapter 20: Network Design Problems Chapter 21: The Traveling Salesman Problem Chapter 22: Facility Location
0 references
combinatorial optimization
0 references
0.946042001247406
0 references
0.9305374026298524
0 references
0.925662875175476
0 references
0.91837078332901
0 references
0.9178380370140076
0 references
