Ask Bookie
{
"item_title" : "Network Flows",
"item_author" : [" Ravindra Ahuja", "Thomas Magnanti", "James Orlin "],
"item_description" : "Bringing together the classicand the contemporary aspects of the field, thiscomprehensive introduction to network flowsprovides an integrative view of theory,algorithms, and applications.It offers in-depth and self-contained treatmentsof shortest path, maximum flow, and minimum costflow problems, including a description of new andnovel polynomial-time algorithms for these coremodels.For professionals workingwith network flows, optimization, and networkprogramming. ",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/13/617/549/013617549X_b.jpg",
"price_data" : {
"retail_price" : "293.32", "online_price" : "293.32", "our_price" : "293.32", "club_price" : "293.32", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Network Flows : Theory, Algorithms, and Applications
Overview
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.
This item is Non-Returnable
Customers Also Bought
- 1
![Mathematical Methods and Algorithms for Signal Processing [With] (Paperback)](https://covers2.booksamillion.com/covers/bam/0/20/136/186/0201361868_w.jpg)
Details
- ISBN-13: 9780136175490
- ISBN-10: 013617549X
- Publisher: Pearson
- Publish Date: February 1993
- Dimensions: 9.59 x 7.32 x 1.88 inches
- Shipping Weight: 3.08 pounds
- Page Count: 864
Related Categories
You May Also Like...
- 1
