{"title":"优先约束最小代价树形问题的混合整数线性规划","authors":"M. dell’Amico, J. Jamal, R. Montemanni","doi":"10.1145/3463858.3463868","DOIUrl":null,"url":null,"abstract":"The minimum-cost arborescence problem is a well-studied problem in the area of graph theory, with known polynomial algorithms for solving the problem. In this paper we introduce a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem, in which precedence constraints are enforced on pairs of nodes. Such constraints prevent some node to be reachable from another node in the arborescence if there is a precedence relationship between the two nodes. The problem has applications in infrastructure designs for oil and gas distribution. We propose a mixed-integer linear programming model for the problem. Experimental results are finally presented and discussed","PeriodicalId":317727,"journal":{"name":"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Mixed Integer Linear Program for a Precedence-Constrained Minimum-Cost Arborescence Problem\",\"authors\":\"M. dell’Amico, J. Jamal, R. Montemanni\",\"doi\":\"10.1145/3463858.3463868\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The minimum-cost arborescence problem is a well-studied problem in the area of graph theory, with known polynomial algorithms for solving the problem. In this paper we introduce a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem, in which precedence constraints are enforced on pairs of nodes. Such constraints prevent some node to be reachable from another node in the arborescence if there is a precedence relationship between the two nodes. The problem has applications in infrastructure designs for oil and gas distribution. We propose a mixed-integer linear programming model for the problem. Experimental results are finally presented and discussed\",\"PeriodicalId\":317727,\"journal\":{\"name\":\"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3463858.3463868\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3463858.3463868","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Mixed Integer Linear Program for a Precedence-Constrained Minimum-Cost Arborescence Problem
The minimum-cost arborescence problem is a well-studied problem in the area of graph theory, with known polynomial algorithms for solving the problem. In this paper we introduce a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem, in which precedence constraints are enforced on pairs of nodes. Such constraints prevent some node to be reachable from another node in the arborescence if there is a precedence relationship between the two nodes. The problem has applications in infrastructure designs for oil and gas distribution. We propose a mixed-integer linear programming model for the problem. Experimental results are finally presented and discussed