Network Optimization: Continuous and Discrete Models (Optimization, Computation, and Control) [Hardcover]

Dimitri P. Bertsekas (Author), Dimitri P. Bertsekas (Author)

Book Description

Publication Date: May 1, 1998 | ISBN-10: 1886529027 | ISBN-13: 978-1886529021

An insightful, comprehensive, and up-to-date treatment of linear, nonlinear, and discrete/combinatorial network optimization problems, their applications, and their analytical and algorithmic methodology. It covers extensively theory, algorithms, and applications, and it aims to bridge the gap between linear and nonlinear network optimization on one hand, and integer/combinatorial network optimization on the other. Among its special features, the book: 1) provides a comprehensive account of the principal algorithms for linear network flow problems, including simplex, dual ascent, and auction algorithms 2) describes the application of network algorithms in many practical contexts, with special emphasis on data communication networks 3) develops in detail the computational complexity analysis of the main linear network optimization algorithms 4) covers extensively the main algorithms for specialized network problems, such as shortest path, max-flow, assignment, and traveling salesman 5) describes the main models for discrete network optimization problems, such as constrained shortest path, traveling salesman, vehicle routing, multidimensional assignment, facility location, spanning tree construction, etc 6) describes the main algorithmic approaches for integer-constrained network problems, such as branch-and-bound, Lagrangian relaxation and subgradient optimization, genetic algorithms, tabu search, simulated annealing, and rollout algorithms 7) develops the main methods for nonlinear network problems, such as convex separable and multicommodity flow problems arising in communication, transportation, and manufacturing contexts 8) discusses extensively auction algorithms, based on the author's original research on the subject 9) contains many examples, practical applications, illustrations, and exercises 10) contains much new material not found in any other textbook

Editorial Reviews

Review

This beautifully written book provides an introductory treatment of linear, nonlinear, and discrete network optimization problems... The textbook is addressed not only to students of optimization but to all scientists in numerous disciplines who need network optimization methods to model and solve problems. This book is an engaging read and it is highly recommended either as a textbook or as a reference on network optimization." --P. Pardalos, Optimization Methods and Sofware

About the Author

The author is McAfee Professor of Engineering at the Massachusetts Institute of Technology and a member of the National Academy of Engineering.

Product Details

• Hardcover: 608 pages
• Publisher: Athena Scientific (May 1, 1998)
• Language: English
• ISBN-10: 1886529027
• ISBN-13: 978-1886529021
• Product Dimensions: 9.3 x 6.6 x 1.3 inches
• Shipping Weight: 2 pounds (View shipping rates and policies)
• Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon Best Sellers Rank: #1,359,420 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

11 of 11 people found the following review helpful:

5.0 out of 5 stars Challenging & Succesful Treatment of the Subject, September 26, 2001

By A Customer

This review is from: Network Optimization: Continuous and Discrete Models (Optimization, Computation, and Control) (Hardcover)

Bertsakas's Network Optimization is probably the most challenging graduate textbook on network flows and optimization. Besides the chapters on classical subjects as shortest path or max-flow/min-cost problems, (which are very rigorously dealt despite their very standard nature of the subjects) I've found especially the Auction Algorithms chapter very throughout and inspiring. The next chapters, Nonlinear Network Optimization and Network Problems with Integer Constraints also are good; these are not usually included in other graduate network optimization books. In each chapter, Author digs into almost all theorems, propositions or notions and don't miss the related proofs or demonstrations, which is usually omitted in other books. I guess it is an important feature for those who want to see theoretical background of the subjects. Its bibliography is very rich and sufficiently up-to-date (until 1997, not bad since it is printed at 1998!). I've found the exercises very challenging, one should consume a very lot of time to do the necessary proofs. These are not as numerous as in Bazaraa's or Ahuja's books, but their quality is by far superior; the author hasn't filled the book with the standard/classical exercises which can be found in all books. Since it deals in detail with the theory, the presentation of the subjects sometimes appears difficult to capture. I also advise to get the errata from book's homepage since it may create sometimes difficulties. The graph theory notions come usually omitted in the book, so one may need a graph theory title to accompany it. Also its appendix that contains a mathematical review somewhat less extensive than in his "Nonlinear Programming" book (almost a separate monograph!), which I recommend highly also. Thus the book comes devoted and concentrated solely on the Network Optimization theory and algorithms, and in my opinion, it became highly successful. I strongly believe that may become the standard title on the subject of the following years. For those who may find its presentation difficult, I suggest to use it along with Ahuja's "Network Flows" which has a more general structure and presentation. But I found the book clearly superior to that book or Bazaraa's "Linear Programming and Network Flows" whose Network Flows chapters are messy. Finally I may say, it is a highly successful book is very worth of its price.

7 of 7 people found the following review helpful:

5.0 out of 5 stars Lucid, well-illustrated study of network flows, December 21, 2000

By A Customer

This review is from: Network Optimization: Continuous and Discrete Models (Optimization, Computation, and Control) (Hardcover)

This is a well-explained, well-illustrated introduction of some of the most important aspects of network flows. (Note: This is an Internet-centric review, even though the book is not about the Internet.) Although the treatment is theoretical rather than specific to the Internet, it is especially relevant now that traffic engineering is being applied to the Internet. Of course ATM and telephone networks have employed this for many years, but there is a need to go back to fundamentals when applying these concepts to the Internet (or other areas). The book starts with the shortest path problem, which is familiar to the Internet community. Then max-flow and min-cost problems are introduced. These are central to traffic engineering. Thereafter non-linear network flow optimization and discrete problems are attacked. Linear programming techniques such as the simplex method are also described. Is excellent training material for those having to wrestle with traffic engineering problems.