Overview

Full Product Details

Author:   Ravindra Ahuja ,  Thomas Magnanti ,  James Orlin
Publisher:   Pearson Education Limited
Imprint:   Pearson Education Limited
Edition:   Pearson New International Edition
Dimensions:   Width: 17.80cm , Height: 4.60cm , Length: 23.40cm
Weight:   1.460kg
ISBN:  

9781292042701

ISBN 10:   1292042702
Pages:   864
Publication Date:   08 November 2013
Audience:   College/higher education ,  Tertiary & Higher Education
Format:   Paperback
Publisher's Status:   Active
Availability:   Available To Order  
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions