Network Flows: Theory, Algorithms, and Applications

Save $25 when you open a Walmart® Credit Card and spend $75 today.

Paid as a statement credit. Subject to credit approval.
Learn More or Apply Now

Advertisement
Advertisement

Network Flows: Theory, Algorithms, and Applications

Format:  Hardcover,

864 pages

Publisher: Prentice Hall

Publish Date: Jan 1993

ISBN-13: 9780136175490

ISBN-10: 013617549X

Buy from Walmart

Shipping & Pickup
Online
$163.35
Not Available at this time

  • Store information not available.

 Buy from Marketplace

Shipping & Additional Information

Book Information

The following content was provided by the publisher.

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.

Specifications

Publisher: Prentice Hall
Publish Date: Jan 1993
ISBN-13: 9780136175490
ISBN-10: 013617549X
Format: Hardcover
Number of Pages: 864
Shipping Weight (in pounds): 3.0
Product in Inches (L x W x H): 7.5 x 10.0 x 1.75

Chapter outline

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

Book 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.

Gifting Plans

Financing Offers

Make the most of your shopping experience with the Walmart® MasterCard® or Walmart Credit Card.

Save $25 when you open a Walmart® Credit Card and spend $75 today.

*Offer subject to credit approval

Learn More or Apply Now