IDEAS home Printed from https://ideas.repec.org/h/spr/advbcp/978-94-6239-701-9_40.html

Research on Knapsack Problem and its Algorithm

In: Proceedings of the 2026 11th International Conference on Social Sciences and Economic Development (ICSSED 2026)

Author

Listed:
  • Peichi Li

    (Stamford American International School Singapore)

Abstract

Resource allocation and constraint optimization problems are prevalent in real life and engineering, such as loading in logistics transportation, asset portfolio management in financial investment, and task scheduling in computer systems. The knapsack problem is an abstract model of these problems and is widely used to describe optimal choices under limited resource conditions. As one of the classic problems in combinatorial optimization, the knapsack problem not only has significant theoretical research value but also has wide applications in practice. This paper systematically introduces several typical knapsack problems, including the 0–1 knapsack problem, the complete knapsack problem, the two-dimensional knapsack problem. The paper primarily focuses on dynamic programming methods and analyzes the state transition equations and algorithmic approaches for each type of problem in detail. This research helps readers understand the different types of knapsack problems and their algorithmic frameworks, and provides a reference for further exploration of more efficient optimization methods.

Suggested Citation

  • Peichi Li, 2026. "Research on Knapsack Problem and its Algorithm," Advances in Economics, Business and Management Research, in: Joanna Rak & Md Rabiul Islam & Noralina Omar & Dragana Ostic (ed.), Proceedings of the 2026 11th International Conference on Social Sciences and Economic Development (ICSSED 2026), pages 387-396, Springer.
    • Handle: RePEc:spr:advbcp:978-94-6239-701-9_40
    DOI: 10.2991/978-94-6239-701-9_40
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:advbcp:978-94-6239-701-9_40. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.