Network Flows

Pearson New International Edition

AvRavindra Ahuja,Thomas Magnanti

Häftad, Engelska, 2013

1 138 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

4 261 kr

Beskrivning

A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.

Produktinformation

Utgivningsdatum:2013-11-08
Mått:178 x 234 x 46 mm
Vikt:1 460 g
Format:Häftad
Språk:Engelska
Antal sidor:864
Upplaga:1
Förlag:Pearson Education
ISBN:9781292042701

Utforska kategorier

Innehållsförteckning

1. Introduction. 2. Paths, Trees and Cycles. 3. Algorithm Design and Analysis. 4. Shortest Paths: Label Setting Algorithms. 5. Shortest Paths: Label Correcting Algorithms. 6. Maximum Flows: Basic Ideas. 7. Maximum Flows: Polynomial Algorithms. 8. Maximum Flows: Additional Topics. 9. Minimum Cost Flows: Basic Algorithms. 10. Minimum Cost Flows: Polynomial Algorithms. 11. Minimum Cost Flows: Network Simplex Algorithms. 12. Assignments and Matchings. 13. Minimum Spanning Trees. 14. Convex Cost Flows. 15. Generalized Flows. 16. Lagrangian Relaxation and Network Optimization. 17. Multicommodity Flows. 18. Computational Testing of Algorithms. 19. Additional Applications. Appendix A: Data Structures. Appendix B: NP-Completeness. Appendix C: Linear Programming. Index.