{"title":"当贪婪产生最佳结果时：统一方法","authors":"Dmitry Rybin","doi":"10.1016/j.disopt.2024.100824","DOIUrl":null,"url":null,"abstract":"<div><p><span>We present necessary and sufficient conditions when a certain greedy object selection algorithm gives optimal results. Our approach covers known results for the Unbounded Knapsack Problem and Change Making Problem and gives new theoretical results for a variety of </span>packing problems. We also provide connections between packing problems and certain bidirectional capacity installation problems on networks.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"51 ","pages":"Article 100824"},"PeriodicalIF":0.9000,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"When greedy gives optimal: A unified approach\",\"authors\":\"Dmitry Rybin\",\"doi\":\"10.1016/j.disopt.2024.100824\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>We present necessary and sufficient conditions when a certain greedy object selection algorithm gives optimal results. Our approach covers known results for the Unbounded Knapsack Problem and Change Making Problem and gives new theoretical results for a variety of </span>packing problems. We also provide connections between packing problems and certain bidirectional capacity installation problems on networks.</p></div>\",\"PeriodicalId\":50571,\"journal\":{\"name\":\"Discrete Optimization\",\"volume\":\"51 \",\"pages\":\"Article 100824\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-02-01\",\"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/S1572528624000033\",\"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/S1572528624000033","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
We present necessary and sufficient conditions when a certain greedy object selection algorithm gives optimal results. Our approach covers known results for the Unbounded Knapsack Problem and Change Making Problem and gives new theoretical results for a variety of packing problems. We also provide connections between packing problems and certain bidirectional capacity installation problems on networks.
期刊介绍：
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
分享
求助内容：
应助结果提醒方式：
扫码关注我们
