Hierarchical Survivable Network Design Problems
Date
2016
Authors
Rodríguez-Martín, I.
Salazar-González, J-J.
Yaman, H.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
19
downloads
downloads
Citation Stats
Series
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.
Source Title
Electronic Notes in Discrete Mathematics
Publisher
Elsevier
Course
Other identifiers
Book Title
Keywords
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English