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


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)