Constraints are required to ensure that the selected nodes and edges form a valid graph.
if an edge (i, j) is selected (e i,j takes value of 1), then both its endpoints i, j must be included: Connectivity is enforced using a set of singlecommodity flow variables f i,j , each taking a nonnegative integral value, representing the flow from node i to j.