A Parallel Branch-and-Cut Algorithm for Capacitated Network Design Problems

Abstract For computationally difficult large-scale integer programming problems branch-and-cut, and more recently, parallel branch-and-cut, has proved to be a viable solution strategy. In this paper we present a parallel branch-andcut algorithm to solve capacitated network design problems based on [9].