Belmont (Mass.): Athena Scientific, 1998. - 585 p.<div class="bb-sep"></div>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 extensivel
Network Optimization: Continuous and Discrete Models [Chapters 1, 2, 3, 10]
✍ Scribed by Dimitri P. Bertsekas, Dimitri P. Bertsekas
- Publisher
- Athena Scientific
- Year
- 1998
- Tongue
- English
- Leaves
- 270
- Series
- Optimization, Computation, and Control
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
Книга Network Optimization: Continuous and Discrete Models Network Optimization: Continuous and Discrete ModelsКниги Компьютерные сети Автор: Dimitri P. Bertsekas Год издания: 1998 Формат: pdf Издат.:Athena Scientific Страниц: 593 Размер: 1,2 Мб ISBN: 1886529027 Язык: Английский0 (голосов: 0) Оценка: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
📜 SIMILAR VOLUMES
<p><p>This book contains contributions from the participants of the research group hosted by the ZiF - Center for Interdisciplinary Research at the University of Bielefeld during the period 2013-2017 as well as from the conclusive conference organized at Bielefeld in December 2017. The contributions
MODELING and OPTIMIZATION of OPTICAL COMMUNICATION NETWORKS Optical networks are an integral part of many of the technologies that we use every day. It is a constantly changing and evolving area, with new materials, processes, and applications coming online almost daily. This book provides a b
Complex behavior models (plasticity, cracks, visco elascticity) face some theoretical difficulties for the determination of the behavior law at the continuous scale. When homogenization fails to give the right behavior law, a solution is to simulate the material at a meso scale in order to simulate
Continuous and discrete modules are, essentially, generalizations of infective and projective modules respectively. Continuous modules provide an appropriate setting for decomposition theory of von Neumann algebras and have important applications to C*-algebras. Discrete modules constitute a dual co
Continuous and discrete modules are, essentially, generalizations of infective and projective modules respectively. Continuous modules provide an appropriate setting for decomposition theory of von Neumann algebras and have important applications to C*-algebras. Discrete modules constitute a dual co