Randomized Algorithms for Removable Online Knapsack Problems.
Xin HanYasushi KawaseKazuhisa MakinoPublished in: FAW-AAIM (2013)
Keyphrases
- knapsack problem
- randomized algorithms
- lower bound
- linear programming relaxation
- optimal solution
- np hard
- approximation algorithms
- optimization problems
- dynamic programming
- worst case
- exact algorithms
- test problems
- online learning
- online algorithms
- cutting plane
- implicit enumeration
- production planning
- upper bound
- practical problems
- greedy algorithm
- mathematical model
- multi objective
- evolutionary algorithm
- genetic algorithm