Year: 2024
Type: conference-paper
Abstract: In this paper, we obtain a number of new simple pseudo-polynomial time algorithms on the well-known knapsack problem, focusing on the running time dependency on the number of items n, the maximum item weight wmax, and the maximum item profit pmax. Our results include:
Authors: Qizheng He, Zhean Xu
Institutions: University of Illinois Urbana-Champaign, Tsinghua University
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4390589869