Network Optimization

by V. Balakrishnan

Overview

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.

Product Details

ISBN-13:	9780412556708
Publisher:	Taylor & Francis
Publication date:	04/01/1995
Series:	Chapman Hall/CRC Mathematics Series , #9
Edition description:	New Edition
Pages:	256
Product dimensions:	6.12(w) x 9.19(h) x (d)
Age Range:	18 Years

About the Author

Balakrishnan\, V.

Table of Contents

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