The MaxFloMinCut.lng Model

Max Flow (dual of Min cut) problem

View the model
Download the model

 Given a network, e.g., a railroad network,
where each arc (i,j) has a capacity c(i,j),
and a source node and a sink,
find the maximum possible flow from the source to the sink;
 References: Ford and Fulkerson, Harris and Ross;


Network | Interdiction | Max Flow | Min Cut |