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,...
保存先:
| 第一著者: | |
|---|---|
| 団体著者: | |
| その他の著者: | , |
| フォーマット: | 電子媒体 eBook |
| 言語: | 英語 |
| 出版事項: |
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.