menu
{ "item_title" : "Network Optimization", "item_author" : [" V. Balakrishnan "], "item_description" : "Topics include optimal branching problems, trans-shipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs, and applications to combinatorics.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/41/255/670/0412556707_b.jpg", "price_data" : { "retail_price" : "101.99", "online_price" : "101.99", "our_price" : "101.99", "club_price" : "101.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Network Optimization|V. Balakrishnan

Network Optimization

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Topics include optimal branching problems, trans-shipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs, and applications to combinatorics.

This item is Non-Returnable

Details

  • ISBN-13: 9780412556708
  • ISBN-10: 0412556707
  • Publisher: CRC Press
  • Publish Date: April 1995
  • Dimensions: 9.5 x 6.16 x 0.68 inches
  • Shipping Weight: 0.56 pounds
  • Page Count: 256

Related Categories

You May Also Like...

    1

BAM Customer Reviews