A Polyhedral Study of the Robust Capacitated Edge Activation Problem

Given a capacitated network, the Capacitated Edge Activation problem consists of activating a minimum cost set of edges in order to serve some traffic demands. If the demands are subject to uncertainty, we speak of the Robust Capacitated Edge Activation problem. We consider the capacity formulation of the robust problem and study the corresponding polyhedron to generalize to the robust problem the results that are known for the problem without uncertainty.