A branch-and-cut algorithm for two-level survivable network design problems

Rodriguez-Martin, Inmaculada and Salazar-Gonzalez, Juan-Jose and Yaman, Hande (2016) A branch-and-cut algorithm for two-level survivable network design problems. Computers and Operations Research, 67. pp. 102-112. ISSN 0305-0548

Full text not available from this repository.

Abstract

This paper approaches the problem of designing a two-level network protected against single-edge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of the hubs through a backbone network (first network level), and the assignment of terminals to hubs and their connection through access networks (second network level). We consider two survivable structures in both network levels. One structure is a two-edge connected network, and the other structure is a ring. There is a limit on the number of nodes in each access network, and there are fixed costs associated with the hubs and the access and backbone links. The aim of the problem is to minimize the total cost. We give integer programming formulations and valid inequalities for the different versions of the problem, solve them using a branch-and-cut algorithm, and discuss computational results. Some of the new inequalities can be used also to solve other problems in the literature, like the plant cycle location problem and the hub location routing problem. (C) 2015 Elsevier Ltd. All rights reserved.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700
Subjects:
ID Code:
126520
Deposited By:
Deposited On:
25 Jul 2018 09:10
Refereed?:
Yes
Published?:
Published
Last Modified:
20 May 2020 06:32