Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Beskrivning
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