Skip to main content

Branch-and-cut strategies for a multi-period network design and routing problem

01 January 2014

New Image

The combined network design and (distributed) traffic routing problem can be formulated as a large-scale multi-period mixed integer optimization problem. This problem combines network design decisions and routing decisions, with time-dependent traffic demands. In this paper, we consider different branch-and-cut strategies for solving the problem with the base and extended formulations proposed in our prior work.