Combinatorial optimization : theory and algorithms /
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
[2002]
|
| Edition: | Second edition. |
| Series: | Algorithms and combinatorics ;
21. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Table of Contents:
- Graphs
- Linear programming
- Linear programming algorithms
- Integer programming
- Spanning trees and arborescences
- Shortest paths
- Network flows
- Minimum cost flows
- Maximum matchings
- Weighted matching
- B-matchings and T-joins
- Matroids
- Generalizations of matroids
- NP-completeness
- Approximation algorithms
- The knapsack problem
- Bin-packing
- Multicommodity flows and edge-disjoint paths
- Network design problems
- The traveling salesman problem.