Revisiting Sparse Dynamic Programming for the 0/1 Knapsack Problem.
Tarequl Islam SifatNirmal PrajapatiSanjay V. RajopadhyePublished in: ICPP (2020)
Keyphrases
- knapsack problem
- dynamic programming
- combinatorial optimization problems
- test problems
- greedy algorithm
- linear programming
- multidimensional knapsack problem
- exact algorithms
- np hard problems
- linear programming relaxation
- multistage
- stereo matching
- np hard
- bicriteria
- reinforcement learning
- heuristic solution
- implicit enumeration
- high dimensional
- greedy heuristic
- continuous relaxation
- infinite horizon
- linear program
- sparse representation
- optimal solution
- lagrangian relaxation
- optimization problems
- lower bound
- integer variables
- neural network
- randomly generated test instances