Linear Network Optimization

4.11 - 1251 ratings - Source

Large-scale optimization is becoming increasingly important for students and professionals in electrical and industrial engineering, computer science, management science and operations research, and applied mathematics. Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. It is the first text to clearly explain important recent algorithms such as auction and relaxation, proposed by the author and others for the solution of these problems. Its coverage of both theory and implementations make it particularly useful as a text for a graduate-level course on network optimization as well as a practical guide to state-of-the-art codes in the field. Bertsekas focuses on the algorithms that have proved successful in practice and provides FORTRAN codes that implement them. The presentation is clear, mathematically rigorous, and economical. Many illustrations, examples, and exercises are included in the text. Dimitri P. Bertsekas is Professor of Electrical Engineering and Computer Science at MIT. Contents: Introduction. Simplex Methods. Dual Ascent Methods. Auction Algorithms. Performance and Comparisons. Appendixes.Algorithms and Codes Dimitri P. Bertsekas. [FoF57] Ford, L. R., Jr., and Fulkerson
, D. R., 1957. ... aquot;Implementation and Computational Comparisons of Primal, Dual
, and Primal-Dual Computer Codes for Minimum Cost Network Flow Problem, aquot;anbsp;...

Title

:

Linear Network Optimization

Author

:

Dimitri P. Bertsekas

Publisher

:

MIT Press - 1991

ISBN-13

:

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.