.png){kind=icon}
Return
A branch-and-cut algorithm for two-level survivable network design problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2015.09.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Network design
Survivability
Hierarchical networks
Valid inequalities
Branch-and-cut
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
21<sup>st</sup> Century challenges of clean energy and global warming-can energy storage systems meet these issues?.png)
2010 3rd International Conference on Thermal Issues in Emerging Technologies Theory and Applications
2010 3rd International Conference on Thermal Issues in Emerging Technologies Theory and ApplicationsIF0
PREAI
ShareSave
ShareSave
ShareSave
View more