A first course in combinatorial optimization /
This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge, UK ; New York :
Cambridge University Press,
2004.
|
| Series: | Cambridge texts in applied mathematics.
|
| Subjects: | |
| Online Access: | CONNECT |
Table of Contents:
- 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.
