IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1097-d1621731.html
   My bibliography  Save this article

Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications

Author

Listed:
  • Tibor Szkaliczki

    (HUN-REN Institute for Computer Science and Control, 1111 Budapest, Hungary)

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.

Suggested Citation

  • Tibor Szkaliczki, 2025. "Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications," Mathematics, MDPI, vol. 13(7), pages 1-35, March.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1097-:d:1621731
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1097/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/7/1097/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1097-:d:1621731. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.