Network Flows
Theory, Algorithms, and Applications
Published on 8. March 1993
Book
Hardback
864 pages
978-0-13-617549-0 (ISBN)
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.
presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models.
emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments.
provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.
devotes a special chapter to conducting empirical testing of algorithms.
features over 150 applications of network flows to a variety of engineering, management, and scientific domains.
contains extensive reference notes and illustrations.
presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models.
emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments.
provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.
devotes a special chapter to conducting empirical testing of algorithms.
features over 150 applications of network flows to a variety of engineering, management, and scientific domains.
contains extensive reference notes and illustrations.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 236 mm
Width: 180 mm
Thickness: 50 mm
Weight
1520 gr
ISBN-13
978-0-13-617549-0 (9780136175490)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Ravindra Ahuja | Ravindra K. Ahuja | Thomas L. Magnanti
Network Flows
Pearson New International Edition
Book
11/2013
1st Edition
Pearson Education Limited
€104.49
Shipment within 10-20 days
Content
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.
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.