Network Flows: Theory, Algorithms, and Applications (Pearson New International Edition)

Network Flows: Theory, Algorithms, and Applications (Pearson New International Edition)

By: James B. Orlin (author), Thomas L. Magnanti (author), Ravindra K. Ahuja (author)Paperback

1 - 2 weeks availability

£52.24 RRP £54.99  You save £2.75 (5%) With FREE Saver Delivery

Description

Create a review

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.

Product Details

  • publication date: 01/11/2013
  • ISBN13: 9781292042701
  • Format: Paperback
  • Number Of Pages: 864
  • ID: 9781292042701
  • weight: 1259
  • ISBN10: 1292042702
  • edition: Pearson New International Edition

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly

Close