arXiv · 2611.15780
Multiple-Choice Knapsack with Small Items
Abstract
The Multiple-Choice Knapsack problem is a generalization of the Knapsack problem in which items are partitioned into disjoint classes and exactly one item must be selected from each class. Besides the standard dynamic program running in time $\mathcal{O}(nc)$, where $n$ is the total number of items and $c$ is the knapsack capacity, no other pseudopolynomial-time algorithm is currently known. We present an $\mathcal{O}(n+w_{\max}^4)$-time algorithm, where $w_{\max}=\max_i (w_{in_i}-w_{i1})$ is the maximum weight range within a class.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jakub Pawlewicz. 2026-11-11. Multiple-Choice Knapsack with Small Items. https://doi.org/10.4230/lipics.esa.2026.29. https://searcharxiv.com/abs/2611.15780
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.