Linear Network Optimization: Algorithms and Codes

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 treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. It explains important 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 suitable 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. Illustrations, examples and exercises are included in the text.