A polyhedral analysis of the capacitated edge activation problemwith uncertain demands

The capacitated edge activation problem consists of activating a minimum cost set ofcapacitated edges to ensure the routing of some traffic demands. If the demands aresubject to uncertainty, we speak of the robust capacitated edge activation problem.We consider a capacity formulation of the problem and investigate, from a polyhe-dral perspective, the similarities and the differences between the robust capacitatededge activation and the robust network loading polyhedron, as well as between thepolyhedra corresponding to different routing and flows policies.