Ahuja, Ravindra K.,  1956- <br/><br/>
Network flows :  theory, algorithms, and applications / 
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. 
 - xv, 846 p. :  ill. ;  25 cm. 
<br/><br/>
<br/><br/>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: [actual symbol not reproducible]-Completeness -- Appendix C: Linear Programming. 
<br/><br/><label>ISBN: </label>013617549X 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Network analysis (Planning)<br/>Mathematical optimization
<br/><br/><label>LC Class. No.: </label>TK57.85  / .A37 1993