This document outlines a maximum flow problem showing shipments between various locations with capacities on each path. It lists the from and to locations, shipment amounts, capacities on each path, and nodes along the paths. It then shows the maximum total flow is 150 and that the net flow equals supply and demand at each location and node.
This document outlines a maximum flow problem showing shipments between various locations with capacities on each path. It lists the from and to locations, shipment amounts, capacities on each path, and nodes along the paths. It then shows the maximum total flow is 150 and that the net flow equals supply and demand at each location and node.
This document outlines a maximum flow problem showing shipments between various locations with capacities on each path. It lists the from and to locations, shipment amounts, capacities on each path, and nodes along the paths. It then shows the maximum total flow is 150 and that the net flow equals supply and demand at each location and node.
Stuttgart Rotterdam 50 <= 50 Stuttgart Stuttgart Bordeaux 70 <= 70 Rotterdam Stuttgart Lisbon 30 <= 40 Bordeaux Rotterdam New York 50 <= 60 Lisbon Bordeaux New York 30 <= 40 New York Bordeaux New Orleans 40 <= 50 New Orleans Lisbon New Orleans 30 <= 30 Los Angeles New York Los Angeles 80 <= 80 New Orleans Los Angeles 70 <= 70