{"title":"Reduction strategies for the Cardinality Constrained Knapsack problem","authors":"K. Pieńkosz","doi":"10.1109/MMAR.2017.8046956","DOIUrl":null,"url":null,"abstract":"In the paper the Cardinality Constrained Knapsack Problem is considered. It is a variant of the Continuous Knapsack Problem in which no more than a specified number of variables are allowed to have positive values. This problem arises when a limited resource is allocated among competing activities, and an upper bound is imposed on the number of activities that can be selected in a solution. The Cardinality Constrained Knapsack Problem is NP-hard. We analyze the structural properties of its optimal solutions and propose procedure allowing to reduce the size of the original problem.","PeriodicalId":189753,"journal":{"name":"2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR.2017.8046956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In the paper the Cardinality Constrained Knapsack Problem is considered. It is a variant of the Continuous Knapsack Problem in which no more than a specified number of variables are allowed to have positive values. This problem arises when a limited resource is allocated among competing activities, and an upper bound is imposed on the number of activities that can be selected in a solution. The Cardinality Constrained Knapsack Problem is NP-hard. We analyze the structural properties of its optimal solutions and propose procedure allowing to reduce the size of the original problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
