Network flows : theory, algorithms, and applications /
Ahuja, Ravindra K., 1956-
Network flows : theory, algorithms, and applications / Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. - Pearson new international edition - Edinburgh, England : Pearson, 2014. - xv, 846 p. ; ill., 24 cm. - Always learning . - Always learning .
Includes bibliographical references 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.
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.
9781292042701 (pbk.)
Mathematical optimization.
Network analysis (Planning).
Matematiksel optimizasyon.
Ağ analizi (Planlama).
T 57.85 / .A38 2014
Network flows : theory, algorithms, and applications / Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. - Pearson new international edition - Edinburgh, England : Pearson, 2014. - xv, 846 p. ; ill., 24 cm. - Always learning . - Always learning .
Includes bibliographical references 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.
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.
9781292042701 (pbk.)
Mathematical optimization.
Network analysis (Planning).
Matematiksel optimizasyon.
Ağ analizi (Planlama).
T 57.85 / .A38 2014