Hierarchical Survivable Network Design Problems

Rodríguez-Martín, Inmaculada and Salazar-González, Juan José and Yaman, Hande (2016) Hierarchical Survivable Network Design Problems. Electronic Notes in Discrete Mathematics, 52. pp. 229-236. ISSN 1571-0653

Full text not available from this repository.

Abstract

We address the problem of designing two-level networks protected against single edge failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected through a backbone network, and terminals must be assigned to hubs and connected to them through access networks, being the objective to minimize the total cost. We consider two survivable structures, two-edge connected (2EC) networks and rings, in both levels of the network. We present an integer programming formulation for these problems, solve them using a branch-and-cut algorithm, and show some computational results.

Item Type:
Journal Article
Journal or Publication Title:
Electronic Notes in Discrete Mathematics
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2604
Subjects:
ID Code:
126524
Deposited By:
Deposited On:
22 Jun 2019 08:37
Refereed?:
Yes
Published?:
Published
Last Modified:
12 Aug 2020 07:39