Skip to content

Network Flows Theory, Algorithms, and Applications

Best in textbook rentals since 2012!

ISBN-10: 013617549X

ISBN-13: 9780136175490

Edition: 1st 1993

Authors: Ravindra Ahuja, Thomas Magnanti, James Orlin

List price: $266.65
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!

Rental notice: supplementary materials (access codes, CDs, etc.) are not guaranteed with rental orders.

what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.
Customers also bought

Book details

List price: $266.65
Edition: 1st
Copyright year: 1993
Publisher: Pearson Education
Publication date: 2/18/1993
Binding: Hardcover
Pages: 864
Size: 7.40" wide x 9.30" long x 2.00" tall
Weight: 3.454

Introduction
Paths, Trees and Cycles
Algorithm Design and Analysis
Shortest Paths: Label Setting Algorithms
Shortest Paths: Label Correcting Algorithms
Maximum Flows: Basic Ideas
Maximum Flows: Polynomial Algorithms
Maximum Flows: Additional Topics
Minimum Cost Flows: Basic Algorithms
Minimum Cost Flows: Polynomial Algorithms
Minimum Cost Flows: Network Simplex Algorithms
Assignments and Matchings
Minimum Spanning Trees
Convex Cost Flows
Generalized Flows
Lagrangian Relaxation and Network Optimization
Multicommodity Flows
Computational Testing of Algorithms
Additional Applications
Data Structures
NP-Completeness
Linear Programming
Index