**ISBN:** 1-886529-02-7

**Publication:** MAY 1998, 608 pages, hardcover

**Price:** $69.00

**EBOOK at Google Play**

**EBOOK at Google Books**

Contents, Preface, Ordering, Home

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. It complements several of our books: Convex Optimization Theory (Athena Scientific, 2009), Convex Optimization Algorithms (Athena Scientific, 2015), Introduction to Linear Optimization (Athena Scientific, 1997), Nonlinear Programming (Athena Scientific, 1999), as well as our other book on the subject of network optimization Network Flows and Monotropic Optimization (Athena Scientific, 1998).

"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."

**Among
its special features, the book:**

provides a comprehensive account of the principal algorithms for linear network flow problems, including simplex, dual ascent, and auction algorithms

describes the application of network algorithms in many practical contexts, with special emphasis on data communication networks

develops in detail the computational complexity analysis of the main linear network optimization algorithms

covers extensively the main algorithms for specialized network problems, such as shortest path, max-flow, assignment, and traveling salesman

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

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

develops the main methods for nonlinear network problems, such as convex separable and multicommodity flow problems arising in communication, transportation, and manufacturing contexts

discusses extensively auction algorithms, based on the author's original research on the subject

contains many examples, practical applications, illustrations, and exercises

contains much new material not found in any other textbook

The author is McAfee Professor of Engineering at the Massachusetts Institute of Technology and a member of the National Academy of Engineering. He is the recipient of the 2001 A. R. Raggazini ACC education award and the 2009 INFORMS expository writing award.

- Prof. Bertsekas' Research Papers on Network Optimization
- Misc network optimization codes by Dimitri P. Bertsekas
- RELAX4 code by Dimitri P. Bertsekas and Paul Tseng, and RELAX4 documentation for linear single commodity network optimization.
- C++ Implementation of RELAX4 code from the University of Pisa
- AUCTION and other algorithms, for linear cost assignment, shortest path, and other network flow problems.
- Errata (400K, pdf)

[Return to Athena Scientific Homepage]