Randomized algorithms for online knapsack problems.
Xin HanYasushi KawaseKazuhisa MakinoPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- knapsack problem
- randomized algorithms
- approximation algorithms
- np hard
- lower bound
- optimization problems
- test problems
- linear programming relaxation
- online learning
- optimal solution
- dynamic programming
- exact algorithms
- production planning
- special case
- implicit enumeration
- online algorithms
- maximum profit
- simulated annealing
- reinforcement learning
- minimum cost
- worst case
- active learning
- evolutionary algorithm
- search algorithm
- learning algorithm