Network Optimization

by V. Balakrishnan

Overview

Problems in network optimization arise in all areas of technology and industrial management. The topic of network flows has applications in diverse fields such as chemistry, engineering, management science, scheduling and transportation, to name a few. Network Optimization introduces the subject to undergraduate and graduate students in computer science, mathematics and operations research. The focus is mainly on developing the mathematical underpinnings of the techniques that make it possible to solve the several optimization problems covered in the text. The text discusses such topics as optimal branching problems, transshipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs and many applications to combinatorics. Also included is a large number of exercises.

Product Details

ISBN-13:	9781000723083
Publisher:	CRC Press
Publication date:	08/16/2019
Series:	Chapman Hall/CRC Mathematics Series
Sold by:	Barnes & Noble
Format:	eBook
Pages:	256
File size:	7 MB

About the Author

V.K. Balakrishnan is a professor of mathematics at the University of Maine, USA.

Table of Contents

Preface, 1 Trees, arborescences and branchings, 2 Transshipment problems, 3 Shortest path problems, 4 Minimum cost flow problems, 5 Matchings in graphs, Further reading, References, Solutions to selected problems, Index