TY  - GEN
AU  - Ahuja, Ravindra K.,
AU  - Orlin, James B.,
AU  - Magnanti, Thomas L.
TI  - Network flows: theory, algorithms, and applications 
SN  - 013617549X
AV  - TK57.85 .A37 1993
PY  - 1993///
CY  - Upper Saddle River, N.J.
PB  - Prentice Hall
KW  - Network analysis (Planning)
KW  - Mathematical optimization
N1  - Includes bibliographical references (p. 821-839) and index; 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
ER  -