A first course in combinatorial optimization
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Kaituhi rangatōpū: | |
| Hōputu: | Tāhiko īPukapuka |
| Reo: | Ingarihi |
| I whakaputaina: |
Cambridge, UK ; New York :
Cambridge University Press,
2004.
|
| Rangatū: | Cambridge texts in applied mathematics.
|
| Ngā marau: | |
| Urunga tuihono: | An electronic book accessible through the World Wide Web; click to view |
| Ngā Tūtohu: |
Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
Rārangi ihirangi:
- 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.