Book contents
- Frontmatter
- Contents
- Preface
- Introduction
- 0 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
- Appendix: Notation and Terminology
- References
- Indexes
0 - Polytopes and Linear Programming
Published online by Cambridge University Press: 28 January 2010
- Frontmatter
- Contents
- Preface
- Introduction
- 0 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
- Appendix: Notation and Terminology
- References
- Indexes
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511616655/resource/name/firstPage-9780511616655c1_p9-48_CBO.jpg)
- Type
- Chapter
- Information
- A First Course in Combinatorial Optimization , pp. 9 - 48Publisher: Cambridge University PressPrint publication year: 2004