Network Optimization
V. Balakrishnan
Network Optimization
V. Balakrishnan
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 not currently in-stock. It can be ordered online and is expected to ship in approx 2 weeks
Our stock data is updated periodically, and availability may change throughout the day for in-demand items. Please call the relevant shop for the most current stock information. Prices are subject to change without notice.
Sign in or become a Readings Member to add this title to a wishlist.