.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Network design
Survivability
Hierarchical networks
Valid inequalities
Branch-and-cut
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
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
分享收藏General network design: A unified view of combined location and network design problems通用网络设计: 位置和网络设计问题的统一视图
OAAI
OAAI分享收藏
分享收藏
查看更多内容