A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem.
David P. DobkinRichard J. LiptonPublished in: J. Comput. Syst. Sci. (1978)
Keyphrases
- knapsack problem
- lower bound
- optimal solution
- linear programming relaxation
- np hard
- search algorithm
- upper bound
- search space
- dynamic programming
- combinatorial optimization problems
- optimization problems
- heuristic solution
- greedy heuristic
- greedy algorithm
- objective function
- branch and bound algorithm
- bicriteria
- multidimensional knapsack problem
- cutting plane
- exact algorithms
- learning algorithm
- continuous relaxation
- lower and upper bounds
- feasible solution
- linear programming
- machine learning
- maximum profit