Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem.
Hans KellererUlrich PferschyPublished in: J. Comb. Optim. (2004)
Keyphrases
- knapsack problem
- dynamic programming
- combinatorial optimization problems
- greedy algorithm
- exact algorithms
- test problems
- multistage
- linear programming
- optimization problems
- bicriteria
- optimal solution
- reinforcement learning
- multidimensional knapsack problem
- np hard problems
- linear programming relaxation
- np hard
- continuous relaxation
- decision variables
- lp relaxation
- greedy heuristic
- integer variables
- implicit enumeration
- multiple objectives
- np hardness
- linear program
- heuristic solution
- neural network
- maximum profit