跳转受限可存活网络设计的整数编程公式计算研究

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2024-11-26 DOI:10.1016/j.dam.2024.11.021

Naga V.C. Gudapati, Enrico Malaguti, Michele Monaci, Paolo Paronuzzi

{"title":"跳转受限可存活网络设计的整数编程公式计算研究","authors":"Naga V.C. Gudapati, Enrico Malaguti, Michele Monaci, Paolo Paronuzzi","doi":"10.1016/j.dam.2024.11.021","DOIUrl":null,"url":null,"abstract":"<div><div>We consider a Network Design problem where edges have to be activated at minimum cost while ensuring that the resulting graph contains at least <span><math><mi>k</mi></math></span> disjoint paths linking a given set of origin–destination pairs. In addition, those paths are constrained in terms of maximum number of intermediate nodes. We consider alternative Integer Programming formulations for the problem and computationally evaluate them on a large benchmark of instances having different features. Finally, we extend our analysis to the case in which the paths must be vertex disjoint.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"362 ","pages":"Pages 71-81"},"PeriodicalIF":1.0000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A computational study on Integer Programming formulations for Hop-constrained survivable network design\",\"authors\":\"Naga V.C. Gudapati, Enrico Malaguti, Michele Monaci, Paolo Paronuzzi\",\"doi\":\"10.1016/j.dam.2024.11.021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We consider a Network Design problem where edges have to be activated at minimum cost while ensuring that the resulting graph contains at least <span><math><mi>k</mi></math></span> disjoint paths linking a given set of origin–destination pairs. In addition, those paths are constrained in terms of maximum number of intermediate nodes. We consider alternative Integer Programming formulations for the problem and computationally evaluate them on a large benchmark of instances having different features. Finally, we extend our analysis to the case in which the paths must be vertex disjoint.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"362 \",\"pages\":\"Pages 71-81\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X24004876\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004876","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

我们考虑的是一个网络设计问题，在这个问题中，必须以最小的成本激活边，同时确保生成的图至少包含 k 条连接给定出发地-目的地对的互不相交的路径。此外，这些路径还受到最大中间节点数的限制。我们考虑了该问题的其他整数编程公式，并在具有不同特征的大型实例基准上对它们进行了计算评估。最后，我们将分析扩展到路径必须是顶点不相交的情况。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A computational study on Integer Programming formulations for Hop-constrained survivable network design

We consider a Network Design problem where edges have to be activated at minimum cost while ensuring that the resulting graph contains at least

k

disjoint paths linking a given set of origin–destination pairs. In addition, those paths are constrained in terms of maximum number of intermediate nodes. We consider alternative Integer Programming formulations for the problem and computationally evaluate them on a large benchmark of instances having different features. Finally, we extend our analysis to the case in which the paths must be vertex disjoint.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.