Chapman & Hall Mathematics - 9: Network Optimization
- 256pages
- 9 heures de lecture
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.
