The MinCutMaxFlo.lng Model

Min Cut (dual of Max Flow) problem

View the model

Download the model

Given a network, e.g., a railroad network,

where each arc (i,j) has a cost to remove, C(i,j),

and a source node and a sink,

Find a minimum cost set of arcs to delete

so that there is no flow (or path) from
the source node to the sink node;

References: Ford and Fulkerson, Harris and Ross;

Keywords:

Network | Interdiction | Max Flow | Min Cut |