Network Flows Theory, Algorithms, and Applications

ISBN-10: 013617549X

ISBN-13: 9780136175490

Edition: 1st 1993

Authors: Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin

List price: $240.40 Buy it from $27.89
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

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.
Used Starting from $142.23
New Starting from $196.69
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS PowerPoint® 2010 Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $240.40
Edition: 1st
Copyright year: 1993
Publisher: Prentice Hall PTR
Publication date: 2/18/1993
Binding: Hardcover
Pages: 864
Size: 7.50" wide x 10.00" long x 1.75" tall
Weight: 3.520
Language: English

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
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×