Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem.
Xueqi HeJoseph C. HartmanPanos M. PardalosPublished in: Informatica (2016)
Keyphrases
- knapsack problem
- dynamic programming
- integer variables
- integer solution
- linear programming relaxation
- combinatorial optimization problems
- continuous relaxation
- greedy algorithm
- linear programming
- multistage
- binary variables
- lp relaxation
- decision variables
- multidimensional knapsack problem
- bicriteria
- production planning
- exact algorithms
- np hard problems
- greedy heuristic
- heuristic solution
- reinforcement learning
- multiple objectives
- sufficient conditions
- implicit enumeration
- neural network
- maximum profit
- single machine
- feasible solution
- genetic algorithm