An iterative dynamic programming approach for the temporal knapsack problem.
François ClautiauxBoris DetienneG. GuillotPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- knapsack problem
- dynamic programming
- combinatorial optimization problems
- test problems
- greedy algorithm
- exact algorithms
- multidimensional knapsack problem
- linear programming relaxation
- bicriteria
- temporal information
- multistage
- heuristic solution
- spatio temporal
- cutting plane
- optimization problems
- np hard problems
- maximum profit
- implicit enumeration
- optimal solution
- multiple objectives
- linear programming
- search algorithm
- continuous relaxation
- machine learning
- lagrangian relaxation
- linear program
- reinforcement learning