1 paper · 1 filter
Dimitris Fotakis, Laurent Gourvès, Aris Pagourtzis +1
In the online unweighted knapsack problem, items arrive sequentially and must be accepted or rejected immediately for a bounded-capacity knapsack, aiming to maximize the total size…