Sold out

r k magnanti Ahuja, Ravindra K. Ahuja, Thomas L. Magnanti, Thomas L. Magnati, James B. Orlin

Network flows

English · Hardback

Description

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.

Product details

Authors	r k magnanti Ahuja, Ravindra K. Ahuja, Thomas L. Magnanti, Thomas L. Magnati, James B. Orlin
Publisher	External catalogues UK

Languages	English
Product format	Hardback
Released	18.02.1993

EAN	9780136175490
ISBN	978-0-13-617549-0
Dimensions	185 mm x 240 mm x 43 mm
Series	Prentice Hall Prentice Hall
Subject	Natural sciences, medicine, IT, technology > IT, data processing

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.