Online Removable Knapsack Problems for Integer-Sized Items.
Kanaho HanjiHiroshi FujiwaraHiroaki YamamotoPublished in: TAMC (2020)
Keyphrases
- knapsack problem
- online learning
- continuous relaxation
- combinatorial optimization problems
- optimization problems
- optimal solution
- test problems
- integer variables
- linear programming relaxation
- greedy algorithm
- np hard
- dynamic programming
- bicriteria
- production planning
- greedy algorithms
- np hard problems
- real time
- lower bound
- shortest path
- genetic algorithm