Network flows : theory, algorithms, and applications / Ravindra K. Ahuja, Department of Industrial & Management Engineering Indian Institute of Technology, Thomas L. Magnanti, Sloan School of Management Massachusetts Institute of Technology, James B. Orlin, Sloan School of Management Massachusetts Institute of Technology.

By: Ahuja, Ravindra K, 1956- [author.]Contributor(s): Magnanti, Thomas L [author.] | Orlin, James B, 1953- [author.]Material type: TextTextLanguage: English Englewood Cliffs, N.J. : Prentice Hall, 1993©1993. Description: xv, 846 pages : illustrations ; 25 cmContent type: text Media type: unmediated Carrier type: volumeISBN: 013617549X (hardback)Subject(s): Network analysis (Planning) | Mathematical optimizationLOC classification: T57.85 .A38 1993
Contents:
Paths, trees, and cycles -- Algorithm design and analysis -- Shortest paths : label-setting algorithms -- Shortest paths : label-correcting algorithms -- Maximum flows : basic ideas -- Maximum flows : polynomial algorithms -- Maximum flows : additional topics -- Minimum cost flows : basic algorithms -- Minimum cost flows : polynomial algorithms -- Minimum cost flows : network simplex algorithms -- Assignments and matchings -- Minimum spanning trees -- Convex cost flows -- Generalized flows -- Lagrangian relaxation and network optimization -- Multicommodity flows -- Computational testing of algorithms -- Additional applications.
Item type Current library Shelving location Call number Copy number Status Date due Barcode
Books MEF Üniversitesi Kütüphanesi
Genel Koleksiyon T57.85 .A38 1993 (Browse shelf (Opens below)) Available 0001828

Includes bibliographical references (pages 821-839) and index.

Paths, trees, and cycles -- Algorithm design and analysis -- Shortest paths : label-setting algorithms -- Shortest paths : label-correcting algorithms -- Maximum flows : basic ideas -- Maximum flows : polynomial algorithms -- Maximum flows : additional topics -- Minimum cost flows : basic algorithms -- Minimum cost flows : polynomial algorithms -- Minimum cost flows : network simplex algorithms -- Assignments and matchings -- Minimum spanning trees -- Convex cost flows -- Generalized flows -- Lagrangian relaxation and network optimization -- Multicommodity flows -- Computational testing of algorithms -- Additional applications.