First course in combinatorial optimization, A
Combinatorial analysis Combinatorial optimization e-böcker
Cambridge University Press
2004
EISBN 9780511187834
Polytopes and Linear Programming.
1. Matroids and the Greedy Algorithm.
2. Minimum-Weight Dipaths.
3. Matroid Intersection.
4. Matching.
5. Flows and Cuts.
6. Cutting Planes.
7. Branch- & -Bound.
8. Optimizing Submodular Functions.
This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
1. Matroids and the Greedy Algorithm.
2. Minimum-Weight Dipaths.
3. Matroid Intersection.
4. Matching.
5. Flows and Cuts.
6. Cutting Planes.
7. Branch- & -Bound.
8. Optimizing Submodular Functions.
This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
