A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem.
David P. DobkinRichard J. LiptonPublished in: MFCS (1976)
Keyphrases
- knapsack problem
- lower bound
- optimal solution
- linear programming relaxation
- np hard
- combinatorial optimization problems
- search space
- upper bound
- exact algorithms
- optimization problems
- multidimensional knapsack problem
- search algorithm
- dynamic programming
- bicriteria
- objective function
- worst case
- branch and bound
- greedy algorithm
- machine learning
- greedy heuristic
- heuristic solution
- continuous relaxation
- branch and bound algorithm
- linear constraints
- lower and upper bounds
- decision variables
- linear programming
- cost function
- reinforcement learning
- genetic algorithm
- neural network