Network flows : theory, algorithms, and applications

Bibliographic Information

Network flows : theory, algorithms, and applications

Ahuja, Magnanti, Orlin

(Pearson new international edition)(Always learning)

Pearson Education, c2014

Available at  / 6 libraries

Search this Book/Journal

Note

Includes bibliographical references (p. 821-839) and index

Description and Table of Contents

Description

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.

Table of Contents

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.

by "Nielsen BookData"

Related Books: 1-2 of 2

Details

  • NCID
    BB15662622
  • ISBN
    • 9781292042701
  • Country Code
    uk
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Harlow
  • Pages/Volumes
    xv, 846 p.
  • Size
    24 cm
  • Parent Bibliography ID
Page Top