Journal article · 2026 · Open access
Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results
INFORMS journal on computing · Published 23 October 2026 · DOI 10.1287/ijoc.2025.1423
In brief
“Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results” is a 2026 journal article by Sunkanghong Wang and 4 co-authors, published in INFORMS journal on computing. OpenAlex counts 0 citations as of 17 November 2026. It is open access: the full text is free to read at SSRN Electronic Journal.
- Citations
- 0
- References
- 62
- Authors
- 5
Abstract
This paper investigates two-dimensional knapsack problems modeled as the Generalized Two-Dimensional Knapsack Problem (G2KP), a variant not previously studied in the literature. The importance of the G2KP lies in its crucial role in designing Branch-Price-and-Cut (BPC) algorithms for the classical Two-Dimensional Bin-Packing Problem. We propose a novel and effective exact solution framework that incorporates both nonnumerically exact and numerically exact algorithms tailored to G2KP. The framework also achieves state-of-the-art performance on the well-known Two-Dimensional Knapsack Problem (with and without item conflicts) and the Two-Dimensional Orthogonal Packing Problem, solving several previously unsolved instances and establishing new benchmark results. These findings highlight the framework’s potential to inspire algorithmic developments for pricing problems in related BPC methods and higher-dimensional packing problems. To support future research, we make the algorithm code, instance data, and detailed results publicly available. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: This study was supported by the Natural Science Foundation of China [Grants 72271062, 72671084, and 52575565], Science and Technology Projects in Guangzhou [Grant 2024A04J01019], and the Province Natural Science Fund of Guangdong [Grants 2025A1515011297 and 2024A1515010246]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1423 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1423 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Wang, S., Baldacci, R., Furini, F., Wei, L., & Liu, Q. (2026). Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results. INFORMS journal on computing. https://doi.org/10.1287/ijoc.2025.1423
MLA 9
Wang, Sunkanghong, et al. “Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results.” INFORMS journal on computing, 2026. https://doi.org/10.1287/ijoc.2025.1423.
Chicago
Wang, Sunkanghong, Roberto Baldacci, Fabio Furini, Lijun Wei, and Qiang Liu. 2026. “Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results.” INFORMS journal on computing. https://doi.org/10.1287/ijoc.2025.1423.
Harvard
Wang, S. et al. (2026) ‘Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results’, INFORMS journal on computing. doi:10.1287/ijoc.2025.1423.
IEEE
S. Wang, R. Baldacci, F. Furini, L. Wei, and Q. Liu, “Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results,” INFORMS journal on computing, 2026, doi: 10.1287/ijoc.2025.1423.
BibTeX
@article{wang2026exact,
title = {{Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results}},
author = {Wang, Sunkanghong and Baldacci, Roberto and Furini, Fabio and Wei, Lijun and Liu, Qiang},
journal = {INFORMS journal on computing},
year = {2026},
doi = {10.1287/ijoc.2025.1423},
url = {https://doi.org/10.1287/ijoc.2025.1423}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Optimization and Packing Problems
- two-dimensional knapsack problem
- two-dimensional bin packing
- branch-price-and-cut
- exact algorithms
- benchmark instances
- pricing problem
Work with this paper
Most-cited papers in Engineering
- A Closed‐form Equation for Predicting the Hydraulic Conductivity of Unsaturated SoilsMartinus Th. van Genuchten · Soil Science Society of America Journal · 1980 · 28,197 citations
- An improved technique for determining hardness and elastic modulus using load and displacement sensing indentation experimentsW. C. Oliver, George M. Pharr · Journal of materials research/Pratt's guide to venture capital sources · 1992 · 27,379 citations
- Digital communicationsOwen Bishop · Routledge eBooks · 2007 · 24,890 citations
- The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysisNorden Eh Huang, Zhengwei Shen, Steven R. Long and 6 more · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 1998 · 24,008 citations
- Numerical Heat Transfer and Fluid FlowSuhas V. Patankar · CRC Press eBooks · 2018 · 23,491 citations
Questions about this paper
How do I cite this paper in APA style?
Wang, S., Baldacci, R., Furini, F., Wei, L., & Liu, Q. (2026). Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results. INFORMS journal on computing. https://doi.org/10.1287/ijoc.2025.1423
How many times has this paper been cited?
0 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at SSRN Electronic Journal: sign in and open the full text from this page.
Who wrote this paper?
Sunkanghong Wang, Roberto Baldacci, Fabio Furini, Lijun Wei, Qiang Liu.
What is the DOI of this paper?
10.1287/ijoc.2025.1423, permanently at https://doi.org/10.1287/ijoc.2025.1423. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.