{"title":"重新审视 p 中值问题的 Cornuéjols-Nemhauser-Wolsey 公式","authors":"Agostinho Agra , Cristina Requejo","doi":"10.1016/j.ejco.2023.100081","DOIUrl":null,"url":null,"abstract":"<div><p>We revisit a formulation for the simple plant facility location and p-median problems introduced by Cornuéjols, Nemhauser and Wolsey (1980). Despite being the smallest known formulation regarding the number of variables, this formulation is barely used or cited in the literature. Here, we reintroduce the formulation for the p-median problem from a different perspective, resulting from the intersection of a selection problem with an additional family of optimality constraints to define the costs correctly. An alternative proof that the linear relaxation of the formulation is equivalent to the linear relaxation of the well-known classical formulation is provided. By exploring the optimality constraints we discuss approaches to derive bounds for large-size instances. These approaches are based on relaxations obtained by eliminating optimality constraints and can be seen as a simple matheuristic to solve large size instances. In particular, we characterize relaxations which provide the optimal solution, and therefore, can be seen as new formulations for the p-median problem. Computational tests are reported showing that the renewed formulation can be used efficiently to solve p-median instances.</p></div>","PeriodicalId":51880,"journal":{"name":"EURO Journal on Computational Optimization","volume":"12 ","pages":"Article 100081"},"PeriodicalIF":2.6000,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192440623000254/pdfft?md5=0bcc422776e1511a6efd5d524a292e3a&pid=1-s2.0-S2192440623000254-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem\",\"authors\":\"Agostinho Agra , Cristina Requejo\",\"doi\":\"10.1016/j.ejco.2023.100081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We revisit a formulation for the simple plant facility location and p-median problems introduced by Cornuéjols, Nemhauser and Wolsey (1980). Despite being the smallest known formulation regarding the number of variables, this formulation is barely used or cited in the literature. Here, we reintroduce the formulation for the p-median problem from a different perspective, resulting from the intersection of a selection problem with an additional family of optimality constraints to define the costs correctly. An alternative proof that the linear relaxation of the formulation is equivalent to the linear relaxation of the well-known classical formulation is provided. By exploring the optimality constraints we discuss approaches to derive bounds for large-size instances. These approaches are based on relaxations obtained by eliminating optimality constraints and can be seen as a simple matheuristic to solve large size instances. In particular, we characterize relaxations which provide the optimal solution, and therefore, can be seen as new formulations for the p-median problem. Computational tests are reported showing that the renewed formulation can be used efficiently to solve p-median instances.</p></div>\",\"PeriodicalId\":51880,\"journal\":{\"name\":\"EURO Journal on Computational Optimization\",\"volume\":\"12 \",\"pages\":\"Article 100081\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2023-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2192440623000254/pdfft?md5=0bcc422776e1511a6efd5d524a292e3a&pid=1-s2.0-S2192440623000254-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Computational Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192440623000254\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Computational Optimization","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192440623000254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
摘要
我们重温了 Cornuéjols、Nemhauser 和 Wolsey(1980 年)提出的简单工厂设施定位和 p 中值问题的公式。尽管这是已知变量数量最少的公式,但该公式在文献中几乎未被使用或引用。在此,我们从另一个角度重新引入 p 中值问题的表述,该表述源于选择问题与正确定义成本的额外最优性约束的交叉。我们还提供了另一种证明,即该公式的线性松弛等同于著名经典公式的线性松弛。通过探索最优性约束,我们讨论了推导大尺寸实例边界的方法。这些方法基于消除最优性约束后得到的松弛,可以看作是解决大尺寸实例的简单数学启发式。特别是,我们描述了提供最优解的松弛的特点,因此,松弛可视为 p-median 问题的新公式。计算测试表明,更新后的公式可以有效地解决 p-median 实例。
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem
We revisit a formulation for the simple plant facility location and p-median problems introduced by Cornuéjols, Nemhauser and Wolsey (1980). Despite being the smallest known formulation regarding the number of variables, this formulation is barely used or cited in the literature. Here, we reintroduce the formulation for the p-median problem from a different perspective, resulting from the intersection of a selection problem with an additional family of optimality constraints to define the costs correctly. An alternative proof that the linear relaxation of the formulation is equivalent to the linear relaxation of the well-known classical formulation is provided. By exploring the optimality constraints we discuss approaches to derive bounds for large-size instances. These approaches are based on relaxations obtained by eliminating optimality constraints and can be seen as a simple matheuristic to solve large size instances. In particular, we characterize relaxations which provide the optimal solution, and therefore, can be seen as new formulations for the p-median problem. Computational tests are reported showing that the renewed formulation can be used efficiently to solve p-median instances.
期刊介绍:
The aim of this journal is to contribute to the many areas in which Operations Research and Computer Science are tightly connected with each other. More precisely, the common element in all contributions to this journal is the use of computers for the solution of optimization problems. Both methodological contributions and innovative applications are considered, but validation through convincing computational experiments is desirable. The journal publishes three types of articles (i) research articles, (ii) tutorials, and (iii) surveys. A research article presents original methodological contributions. A tutorial provides an introduction to an advanced topic designed to ease the use of the relevant methodology. A survey provides a wide overview of a given subject by summarizing and organizing research results.