A first course in combinatorial optimization
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Searvvušdahkki: | |
| Materiálatiipa: | Elektrovnnalaš E-girji |
| Giella: | eaŋgalasgiella |
| Almmustuhtton: |
Cambridge, UK ; New York :
Cambridge University Press,
2004.
|
| Ráidu: | Cambridge texts in applied mathematics.
|
| Fáttát: | |
| Liŋkkat: | An electronic book accessible through the World Wide Web; click to view |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|
Sisdoallologahallan:
- 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.