.png){kind=icon}
Return
A fast algorithm for the linear multiple-choice knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0167-6377(84)90027-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available