Network flows : theory, algorithms and applications

Among all topics covered in operations research, network flows theory offers the best context to illustrate the basic concepts of optimization. This book provides an integrative view of the theory, algorithms and applications of network flows. In order for their presentation to be more intuitive and...

Full description

Bibliographic Details
Main Authors: Ahuja, Ravindra K. , 1956- (Author), Magnanti, Thomas L. (Author), Orlin, James B. , 1953- (Author)
Format: Book
Language:English
Published: Harlow, London : Person Education , c2014
Subjects:

MARC

LEADER 00000cam a2200000 7i4500
001 0000086242
005 20150122093000.0
008 140302s2014 enk eng
020 |a 013617549X 
020 |a 1292042702 
020 |a 9780136175490 
020 |a 9781292042701 
050 0 0 |a T57.85   |b .A38 2014 
090 0 0 |a T57.85   |b .A38 2014 
100 1 |a Ahuja, Ravindra K. ,   |d 1956- ,   |e author 
245 1 3 |a Network flows :   |b theory, algorithms and applications   |c Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin 
260 |a Harlow, London :   |b Person Education ,   |c c2014 
300 |a xv, 846 p. :   |b ill. ;   |c 24 cm. 
504 |a Includes bibliographical references (p. 821-839) and index 
505 0 |a 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 
520 |a Among all topics covered in operations research, network flows theory offers the best context to illustrate the basic concepts of optimization. This book provides an integrative view of the theory, algorithms and applications of network flows. In order for their presentation to be more intuitive and accessible to a wider audience, the authors prefer to adopt a network or graphical viewpoint rather than relying on a linear programming approach. 
650 0 |a Mathematical optimization 
650 0 |a Network analysis (Planning) 
700 1 |a Magnanti, Thomas L. ,   |e author 
700 1 |a Orlin, James B. ,   |d 1953- ,   |e author 
999 |a 1000163434   |b Book   |c OPEN SHELF (30 DAYS)   |e Gong Badak Campus