An alternative to Ben-Or's lower bound for the knapsack problem complexity.
Valentin E. BrimkovStefan S. DantchevPublished in: Appl. Math. Lett. (2002)
Keyphrases
- knapsack problem
- lower bound
- optimal solution
- linear programming relaxation
- np hard
- worst case
- combinatorial optimization problems
- upper bound
- test problems
- dynamic programming
- optimization problems
- greedy algorithm
- exact algorithms
- branch and bound algorithm
- branch and bound
- cutting plane
- objective function
- production planning
- heuristic solution
- multidimensional knapsack problem
- bicriteria
- greedy heuristic
- np hard problems
- computational complexity
- continuous relaxation
- lower and upper bounds
- decision variables
- lagrangian relaxation
- heuristic methods
- column generation
- approximation algorithms
- scheduling problem
- constraint satisfaction problems
- np complete