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,...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Korporativní autor: | |
| Další autoři: | , |
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cambridge ; New York :
Cambridge University Press,
2011.
|
| Edice: | Cambridge texts in applied mathematics.
|
| Témata: | |
| On-line přístup: | An electronic book accessible through the World Wide Web; click to view |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- 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.