Combinatorial Optimization: Theory and AlgorithmsNow fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added. |
Contents
1 | |
13 | |
Linear Programming 49 | 48 |
Linear Programming Algorithms | 71 |
Integer Programming 99 | 98 |
Spanning Trees and Arborescences | 127 |
Shortest Paths | 151 |
Network Flows | 165 |
10 | 227 |
15 | 359 |
Network Design Problems 491 | 490 |
The Traveling Salesman Problem | 527 |
Facility Location | 563 |
Notation Index | 599 |
613 | |
Minimum Cost Flows 199 | 198 |
Other editions - View all
Combinatorial Optimization: Theory and Algorithms Bernhard Korte,Jens Vygen No preview available - 2010 |
Combinatorial Optimization: Theory and Algorithms Bernhard Korte,Jens Vygen No preview available - 2009 |
Common terms and phrases
apply approximation algorithm assume augmenting blossom bound called capacity cardinality Chapter choose circuit claim clauses combinatorial optimization Computing connected components consider consists construct contains convex Corollary corresponding cost cover define Definition digraph directed dual edge elements equivalent example Exercise exists face facility feasible finite function given graph G Hence holds implies incidence independence induction inequality input instance integral iteration Journal least Lemma length Let G Mathematics matrix matroid maximal maximum minimal minimum weight Moreover Note observe obtain Operations optimum solution oracle otherwise outer path perfect matching planar points polynomial polytope PROBLEM Proof Proposition prove respect rows running satisfies shortest solution solve spanning tree subset Suppose Theorem Theory tour undirected graph variables vector vertex vertices weight