Network Flows: Theory, Algorithms, and Applications
Product Description
Network Flows: Theory, Algorithms, and Applications
Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including a description of new and novel polynomial-time algorithms for these core models. For professionals working with network flows, optimization, and network programming.
Technical Specifications
You might also like
Linear Models with R, Second Edition (Chapman & Hall/CRC Texts in Statistical Science)
Introduction to Linear Regression Analysis
Simulation Modeling and Analysis (McGraw-Hill Series in Industrial Engineering and Management)
Introduction to Linear Optimization (Athena Scientific Series in Optimization and Neural Computation, 6)
Discrete-Event System Simulation (5th Edition)
Simulation Modeling and Analysis (McGraw-Hill Series in Industrial Engineering and Management)
Nonlinear Programming: Theory and Algorithms
Linear Programming and Network Flows
Introduction to Probability Models, Eleventh Edition
Strategic Decision Making: Multiobjective Decision Analysis with Spreadsheets