Network Flows
Network Flows
Summary
A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.
The feel-good place to buy books
- Free US shipping over $15
- B Corp - kinder to people and planet
- Millions of affordable books
- Give your books a new home - sell them back to us!
Network Flows by Ravindra Ahuja
A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications. presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models. emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments. provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees. devotes a special chapter to conducting empirical testing of algorithms. features over 150 applications of network flows to a variety of engineering, management, and scientific domains. contains extensive reference notes and illustrations.| SKU | Unavailable |
| EAN | 9780136175490 |
| Title | Network Flows |
| Release date | 1993-02-18 |
| Studio | Pearson |
| Condition | Unavailable |
| Note | Unavailable |
| By (author) | Ravindra Ahuja |
| By (author) | Thomas Magnanti |
| By (author) | James Orlin |
