1 paper
Matthias Gehnen, Kübra Güven, Moritz Stocker
We introduce the Online Unbounded Knapsack Problem with Removal, a variation of the well-known Online Knapsack Problem. Items, each with a weight and value, arrive online and an al…