Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications
Szkaliczki, Tibor (2025) Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications. MATHEMATICS, 13 (7). ISSN 2227-7390 10.3390/math13071097
|
Text
Szkaliczki_1_36228518_ny.pdf Download (2MB) | Preview |
Abstract
The Knapsack Problem belongs to the best-studied classical problems in combinatorial optimization. The Multiple-choice Knapsack Problem (MCKP) represents a generalization of the problem, with various application fields such as industry, transportation, telecommunication, national defense, bioinformatics, finance, and life. We found a lack of survey papers on MCKP. This paper overviews MCKP and presents its variants, solution methods, and applications. Traditional operational research methods solving the knapsack problem, such as dynamic programming, greedy heuristics, and branch-and-bound algorithms, can be adapted to MCKP. Only a few algorithms appear to have solved the problem in recent years. We found various related problems during the literature study and explored the broad spectrum of application areas. We intend to inspire research into MCKP algorithms and motivate experts from different domains to apply MCKP. © 2025 by the author.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | dynamic programming; Combinatorial optimization; Greedy heuristics; knapsack problem; multiple-choice knapsack problem; |
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | ELearning Department |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 07 Jul 2025 04:56 |
| Last Modified: | 07 Jul 2025 04:56 |
| URI: | https://eprints.sztaki.hu/id/eprint/10929 |
 |
Update Item |
