000			01849 a2200313 4500
001			12145
999			_c12145 _d1320
003			TR-AnTOB
005			20200511160802.0
008			110622s1993 njua b 001 0 d
020			_a013617549X
035			_a(SBN)ALT4004
040			_aCU-SB _cCU-SB _dOrLoB-B
041			_aeng
050			_aTK57.85 _b.A37 1993
090			_aTK57.85 .A37 1993
100			_aAhuja, Ravindra K., _d1956- _94600
245		0	_aNetwork flows : _btheory, algorithms, and applications / _cRavindra K. Ahuja, Thomas L. Magnanti, James B. Orlin.
264		1	_aUpper Saddle River, N.J. : _bPrentice Hall, _cc1993.
300			_axv, 846 p. : _bill. ; _c25 cm.
504			_aIncludes bibliographical references (p. 821-839) and index.
505			_a1. 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.
650			_aNetwork analysis (Planning) _94603
650			_aMathematical optimization _91131
700			_aOrlin, James B., _d1953- _94601
700			_aMagnanti, Thomas L. _936300
942			_cBK