M8.3 Maximal-Flow Problem
The maximal-flow problem involves determining the maximum amount of material that can flow from one point (the source) to another (the sink) in a network. Examples of this type of problem include determining the maximum number of cars that can flow through a highway system, the maximum amount of a liquid that can flow through a series of pipes, and the maximum amount of data that can flow through a computer network. We will begin by presenting an example.
Maximal-Flow Technique
Waukesha, Wisconsin, is in the process of developing a road system for the downtown area. Bill Blackstone, one of the city planners, would like to determine the maximum ...
Get Quantitative Analysis for Management, 13/e now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
