Network Optimization: Continuous and Discrete Models

Front Cover
Athena Scientific, Jan 1, 1998 - Business & Economics - 607 pages

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

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Introduction
1
ShortestPathProblems
51
TheMaxFlowProblem
115
p
151
p
162
p
169
Dual Ascent Methods for MinCost Flow
213
p
251
p
355
p
365
p
375
p
382
p
389
p
407
p
467
MathematicalReview
545

p
337
p
346
References
555
Index
587

Other editions - View all

Common terms and phrases

About the author (1998)

Dimitri Bertsekas studied Mechanical and Electrical Engineering at the National Technical University of Athens, Greece, and obtained his Ph.D. in system science from the Massachusetts Institute of Technology. He has held faculty positions with the Engineering-Economic Systems Department, Stanford University, and the Electrical Engineering Department of the University of Illinois, Urbana. Since 1979 he has been teaching at the Electrical Engineering and Computer Science Department of the Massachusetts Institute of Technology (M.I.T.), where he is McAfee Professor of Engineering. In 2019, he joined the School of Computing, Informatics, and Decision Systems Engineering at the Arizona State University, Tempe, AZ, as Fulton Professor of Computational Decision Making.

Professor Bertsekas' teaching and research have spanned several fields, including deterministic optimization, dynamic programming and stochastic control, large-scale and distributed computation, artificial intelligence, and data communication networks. He has authored or coauthored numerous research papers and eighteen books, several of which are currently used as textbooks in MIT classes, including ``Dynamic Programming and Optimal Control," ``Data Networks," ``Introduction to Probability," and ``Nonlinear Programming."

Professor Bertsekas was awarded the INFORMS 1997 Prize for Research Excellence in the Interface Between Operations Research and Computer Science for his book ``Neuro-Dynamic Programming" (co-authored with John Tsitsiklis), the 2001 AACC John R. Ragazzini Education Award, the 2009 INFORMS Expository Writing Award, the 2014 AACC Richard Bellman Heritage Award, the 2014 INFORMS Khachiyan Prize for Life-Time Accomplishments in Optimization, and the 2015 MOS/SIAM George B. Dantzig Prize. In 2018 he shared with his coauthor, John Tsitsiklis, the 2018 INFORMS John von Neumann Theory Prize for the contributions of the research monographs ``Parallel and Distributed Computation" and ``Neuro-Dynamic Programming." Professor Bertsekas was elected in 2001 to the United States National Academy of Engineering for "pioneering contributions to fundamental research, practice and education of optimization/control theory, and especially its application to data communication networks."

Bibliographic information