Iterative methods in combinatorial optimization
"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence,...
Saved in:
| 主要作者: | |
|---|---|
| 企業作者: | |
| 其他作者: | , |
| 格式: | 電子 電子書 |
| 語言: | 英语 |
| 出版: |
Cambridge ; New York :
Cambridge University Press,
2011.
|
| 叢編: | Cambridge texts in applied mathematics.
|
| 主題: | |
| 在線閱讀: | An electronic book accessible through the World Wide Web; click to view |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
書本目錄:
- Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary.