Víctor Bucarey, Natividad González-Blanco, Martine Labbé, Juan A. Mesa
{"title":"论\\(\\lambda \\) -分界点和网络设计的广义中心:定义和属性","authors":"Víctor Bucarey, Natividad González-Blanco, Martine Labbé, Juan A. Mesa","doi":"10.1007/s10479-025-06536-5","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we extend the notions of <span>\\(\\lambda \\)</span>-cent-dian and generalized-center from Facility Location Theory to the more intricate domain of Network Design. Our focus is on the task of designing a sub-network within a given underlying network while adhering to a budget constraint. This sub-network is intended to efficiently serve a collection of origin/destination pairs of demand. The <span>\\(\\lambda \\)</span>-cent-dian problem studies the balance between efficiency and equity. We investigate the properties of the <span>\\(\\lambda \\)</span>-cent-dian and generalized-center solution networks under the lens of equity, efficiency, and Pareto-optimality. We finally prove that the problems solved here are NP-hard.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"347 3","pages":"1193 - 1211"},"PeriodicalIF":4.4000,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On \\\\(\\\\lambda \\\\)-cent-dians and generalized-center for network design: definitions and properties\",\"authors\":\"Víctor Bucarey, Natividad González-Blanco, Martine Labbé, Juan A. Mesa\",\"doi\":\"10.1007/s10479-025-06536-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we extend the notions of <span>\\\\(\\\\lambda \\\\)</span>-cent-dian and generalized-center from Facility Location Theory to the more intricate domain of Network Design. Our focus is on the task of designing a sub-network within a given underlying network while adhering to a budget constraint. This sub-network is intended to efficiently serve a collection of origin/destination pairs of demand. The <span>\\\\(\\\\lambda \\\\)</span>-cent-dian problem studies the balance between efficiency and equity. We investigate the properties of the <span>\\\\(\\\\lambda \\\\)</span>-cent-dian and generalized-center solution networks under the lens of equity, efficiency, and Pareto-optimality. We finally prove that the problems solved here are NP-hard.</p></div>\",\"PeriodicalId\":8215,\"journal\":{\"name\":\"Annals of Operations Research\",\"volume\":\"347 3\",\"pages\":\"1193 - 1211\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10479-025-06536-5\",\"RegionNum\":3,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-025-06536-5","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
On \(\lambda \)-cent-dians and generalized-center for network design: definitions and properties
In this paper, we extend the notions of \(\lambda \)-cent-dian and generalized-center from Facility Location Theory to the more intricate domain of Network Design. Our focus is on the task of designing a sub-network within a given underlying network while adhering to a budget constraint. This sub-network is intended to efficiently serve a collection of origin/destination pairs of demand. The \(\lambda \)-cent-dian problem studies the balance between efficiency and equity. We investigate the properties of the \(\lambda \)-cent-dian and generalized-center solution networks under the lens of equity, efficiency, and Pareto-optimality. We finally prove that the problems solved here are NP-hard.
期刊介绍:
The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications.
In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.