Chapman Hall/Crc Mathematics Ser.: Network Optimization by V. Balakrishnan (1995, Hardcover)
1798books (223)
100% positive Feedback
Price:
£71.99
Free postage
Estimated by Wed, 6 Aug - Wed, 13 AugEstimated delivery Wed, 6 Aug - Wed, 13 Aug
Returns:
30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.
Condition:
NewNew
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. > 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. > PrefaceTrees, arborescences and branchingsTransshipment problemsShortest path problemsMinimum cost flow problemsMatching in graphsReferencesSolutions to selected problemsIndex