Network Flows

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.

List 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.

Summary

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.

Product details

• Authors: Ravindra Ahuja, Ravindra K. Ahuja, Thomas Magnanti, Thomas L. Magnanti, James Orlin, James B. Orlin
• Publisher: Pearson Academic
• Languages: English
• Product format: Paperback / Softback
• Released: 01.11.2013
• EAN: 9781292042701
• ISBN: 978-1-292-04270-1
• No. of pages: 864
• Dimensions: 178 mm x 234 mm x 46 mm
• Weight: 1460 g
• Series: Pearson; Pearson
• Subject: Natural sciences, medicine, IT, technology > IT, data processing > General, dictionaries