An introduction to linear, nonlinear, and discrete network optimization problems, and the analytical and algorithmic methodology for solving them. Provides a guide to network models and applications, and highlights the interplay between continuous and discrete models. Regarding continuous network optimization, Bertsekas (electrical engineering and computer science, M.I.T.) focuses on duality and iterative cost improvement. In addressing discrete network optimization, he illustrates problem formulation through major paradigms such as traveling salesman, spanning tree, matching, and routing. Can be used for a first-year graduate level course. Annotation copyrighted by Book News, Inc., Portland, OR