Benders decomposition for capacitated network design

Given a capacitated network, we consider the problem of choosing the edges to be activated to ensure the routing of a set of traffic demands. Both splittable and unsplittable flows are investigated. We present polyhedral results and develop a branch-and-cut algorithm based on a Benders decomposition approach to solve the problem.