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

2026 11th International Conference on Social Sciences and Economic Development (ICSSED 2026)

📍Beijing, China🗓️ 20-22 March 2026
<Previous Article In Volume
Next Article In Volume>

Research on Knapsack Problem and its Algorithm

Authors
Peichi Li1, *
1Stamford American International School Singapore, Singapore, 357684, Singapore
*Corresponding author. Email: lpts1011@gmail.com
Corresponding Author
Peichi Li
Available Online 30 July 2026.
DOI
10.2991/978-94-6239-701-9_40How to use a DOI?
Keywords
Knapsack problem; Dynamic programming; Optimization
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.

Copyright
© 2026 The Author(s)
Open Access
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2026 11th International Conference on Social Sciences and Economic Development (ICSSED 2026)
Series
Advances in Economics, Business and Management Research
Publication Date
30 July 2026
ISBN
978-94-6239-701-9
ISSN
2352-5428
DOI
10.2991/978-94-6239-701-9_40How to use a DOI?
Copyright
© 2026 The Author(s)
Open Access
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Cite this article

risenwbib
TY  - CONF
AU  - Peichi Li
PY  - 2026
DA  - 2026/07/30
TI  - Research on Knapsack Problem and its Algorithm
BT  - Proceedings of the 2026 11th International Conference on Social Sciences and Economic Development (ICSSED 2026)
PB  - Atlantis Press
SP  - 387
EP  - 396
SN  - 2352-5428
UR  - https://doi.org/10.2991/978-94-6239-701-9_40
DO  - 10.2991/978-94-6239-701-9_40
ID  - Li2026
ER  -