Online Unweighted Knapsack Problem with Removal Cost.
Xin HanYasushi KawaseKazuhisa MakinoPublished in: Algorithmica (2014)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- decision variables
- test problems
- optimal solution
- optimization problems
- dynamic programming
- np hard
- production planning
- online learning
- exact algorithms
- greedy algorithm
- linear programming relaxation
- np hard problems
- bicriteria
- multiple objectives
- greedy heuristic
- implicit enumeration
- maximum profit
- minimum cost
- linear programming
- continuous relaxation
- randomly generated test instances