The online knapsack problem with incremental capacity.
Clemens ThielenMorten TiedemannStephan WestphalPublished in: Math. Methods Oper. Res. (2016)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- test problems
- dynamic programming
- optimal solution
- optimization problems
- greedy algorithm
- exact algorithms
- production planning
- online learning
- np hard
- linear programming relaxation
- continuous relaxation
- multidimensional knapsack problem
- cutting plane
- np hard problems
- implicit enumeration
- greedy heuristic
- heuristic solution
- maximum profit
- bicriteria
- multistage
- vehicle routing problem
- linear programming
- evolutionary algorithm