{"title":"覆盖集的k聚集闭包","authors":"Haoran Zhu","doi":"10.1016/j.disopt.2023.100805","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we will answer a more general version of one of the questions proposed by Bodur et al. (2017). Specifically, we show that the <span><math><mi>k</mi></math></span><span>-aggregation closure of a covering set is a polyhedron.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"50 ","pages":"Article 100805"},"PeriodicalIF":0.9000,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The k-aggregation closure for covering sets\",\"authors\":\"Haoran Zhu\",\"doi\":\"10.1016/j.disopt.2023.100805\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we will answer a more general version of one of the questions proposed by Bodur et al. (2017). Specifically, we show that the <span><math><mi>k</mi></math></span><span>-aggregation closure of a covering set is a polyhedron.</span></p></div>\",\"PeriodicalId\":50571,\"journal\":{\"name\":\"Discrete Optimization\",\"volume\":\"50 \",\"pages\":\"Article 100805\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1572528623000476\",\"RegionNum\":4,\"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 Optimization","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1572528623000476","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
In this paper, we will answer a more general version of one of the questions proposed by Bodur et al. (2017). Specifically, we show that the -aggregation closure of a covering set is a polyhedron.
期刊介绍：
Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
