The cut property under demand uncertainty

We consider the robust network design problem, which consists of choosing capacities for the edges of a graph so that a set of uncertain traffic demands can be routed. The scope of the paper is to study the robust cut property (RCP), that is, we investigate when the cut inequalities are sufficient to guarantee a feasible routing under demand uncertainty. We provide conditions that ensure the RCP. We discuss the generalization to the problem with uncertain demands of the results that are known for the problem without uncertainty.