Network Flows

Pearson New International Edition

Häftad, Engelska, 2013

Av Ravindra Ahuja, Thomas Magnanti, James Orlin

1 489 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Inbunden

5 659 kr

Skickas inom 3-6 vardagar

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

Utgivningsdatum2013-11-08
Mått178 x 234 x 46 mm
Vikt1 460 g
FormatHäftad
SpråkEngelska
Antal sidor864
Upplaga1
FörlagPearson Education
ISBN9781292042701

Tillhör följande kategorier

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.