Opening book details…
Can I read Network Flows: Theory, Algorithms, and Applications(conservative) on EtoBox?
Network Flows: Theory, Algorithms, and Applications(conservative) by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin is a nonfiction available to read on EtoBox.
What is Network Flows: Theory, Algorithms, and Applications(conservative) about?
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.
Who reads Network Flows: Theory, Algorithms, and Applications(conservative)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
- Publisher
- Pearson ; Prentice Hall
- Published
- 1993
- Language
- EN
- ISBN
- 9780136177548
- Category
- nonfiction
- Subjects
- Management, Technology, Computer Science
- Rating
- 4.22 / 5 (32 ratings)
- Updated
- 2026-03-13
Other editions & translations
More by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Browse all works by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Similar books
- Network Science : Analysis and Optimization Algorithms for Real-World Applications — Carlos Andre Reis Pinheiro (2023)
- Linear Programming and Network Flows — Mokhtar S. Bazaraa, John J. Jarvis (1977)
- Design and Analysis of Algorithms — Khuller S. (2003)
- Graphs : Theory and Algorithms — Olga Moreira (2020)
- Net Theory and Its Applications Flows in Networks Volume 1 — Chen, Wai-Kai (2003)
- Theory of Nets : Flows in Networks — Chen, Wai-Kai, Chen, W.-K (1990)