Removable Online Knapsack with Bounded Size Items.

Laurent Gourvès Aris Pagourtzis

Published in: SOFSEM (2024)

Keyphrases

knapsack problem
online learning
computational complexity
standard deviation
website
search algorithm
search costs
database
upper bound
dynamic programming
optimal solution
information retrieval
multi agent
neural network
small size
polynomial size
real time