The Complexity of Lifted Inequalities for the Knapsack Problem.
David HartvigsenEitan ZemelPublished in: Discret. Appl. Math. (1992)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- optimal solution
- optimization problems
- test problems
- binary variables
- np hard
- linear programming relaxation
- computational complexity
- heuristic solution
- greedy algorithm
- probabilistic inference
- bicriteria
- exact algorithms
- cutting plane
- greedy heuristic
- integer variables
- multidimensional knapsack problem
- np hard problems
- continuous relaxation
- neural network
- sufficient conditions
- graphical models
- worst case
- maximum profit
- lp relaxation
- decision variables
- production planning