Network Optimization

ISBN-13: 9780412556708 / Angielski / Twarda / 1995 / 256 str.

V. K. Balakrishnan; C. Moire

Opis

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.

Spis treści

Preface
Trees, arborescences and branchings
Transshipment problems
Shortest path problems
Minimum cost flow problems
Matching in graphs
References
Solutions to selected problems
Index

O autorze

Balakrishnan\, V.