Design of survivable networks with low connectivity requirements

IF 3.1 4区 管理学 Q2 MANAGEMENT
Fatmah Almathkour, Youcef Magnouche, A. Ridha Mahjoub, Raouia Taktak
{"title":"Design of survivable networks with low connectivity requirements","authors":"Fatmah Almathkour,&nbsp;Youcef Magnouche,&nbsp;A. Ridha Mahjoub,&nbsp;Raouia Taktak","doi":"10.1111/itor.13511","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we consider the survivable network design problem when the connectivity types are in {0, 1, 2, 3}. The problem has wide applications in telecommunication networks. We consider the problem from a polyhedral point of view. We describe several classes of valid inequalities and give necessary conditions and sufficient conditions for these inequalities to be facet defining. We also develop separation routines for these inequalities. Using these results, we devise a branch-and-cut algorithm along with an extensive computational study is presented.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 2","pages":"918-960"},"PeriodicalIF":3.1000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Transactions in Operational Research","FirstCategoryId":"91","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/itor.13511","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we consider the survivable network design problem when the connectivity types are in {0, 1, 2, 3}. The problem has wide applications in telecommunication networks. We consider the problem from a polyhedral point of view. We describe several classes of valid inequalities and give necessary conditions and sufficient conditions for these inequalities to be facet defining. We also develop separation routines for these inequalities. Using these results, we devise a branch-and-cut algorithm along with an extensive computational study is presented.

设计连接要求低的可生存网络
本文考虑的是连接类型为 {0, 1, 2, 3} 时的可生存网络设计问题。该问题在电信网络中有着广泛的应用。我们从多面体的角度来考虑这个问题。我们描述了几类有效的不等式,并给出了这些不等式定义面的必要条件和充分条件。我们还为这些不等式开发了分离例程。利用这些结果,我们设计了一种分支切割算法,并进行了广泛的计算研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Transactions in Operational Research
International Transactions in Operational Research OPERATIONS RESEARCH & MANAGEMENT SCIENCE-
CiteScore
7.80
自引率
12.90%
发文量
146
审稿时长
>12 weeks
期刊介绍: International Transactions in Operational Research (ITOR) aims to advance the understanding and practice of Operational Research (OR) and Management Science internationally. Its scope includes: International problems, such as those of fisheries management, environmental issues, and global competitiveness International work done by major OR figures Studies of worldwide interest from nations with emerging OR communities National or regional OR work which has the potential for application in other nations Technical developments of international interest Specific organizational examples that can be applied in other countries National and international presentations of transnational interest Broadly relevant professional issues, such as those of ethics and practice Applications relevant to global industries, such as operations management, manufacturing, and logistics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信