Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not o

Offers an up-to-date, unified treatment of combinatorial algorithms to solve network flow problems for graduate students and professionals.

Excerpt from Network Flows Perhaps no subfield of mathematical programming is more alluring than network optimization. Highway, rail, electrical, communication

Table of contents

There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in grap