Linked e-resources
Details
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.
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.