Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints

In this paper, we propose three branch-and-cut algorithms, which are significantly more efficient in solving the NDPVC. The first algorithm is a cutting-plane method devised in the context of a new layered graph ILP formulation, whereas the other two are based on Benders decomposition methods of previously known formulations. With the proposed new methods, we are able to solve substantially more instances of the NDPVC and therefore able to provide a more complete comparison of its solutions to those of the kHSNDP.