A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems.
David P. DobkinPublished in: J. Comput. Syst. Sci. (1976)
Keyphrases
- search tree
- branch and bound algorithm
- integer variables
- lower bound
- knapsack problem
- optimal solution
- np hard
- upper bound
- branch and bound
- linear programming relaxation
- combinatorial optimization
- search space
- backtracking algorithm
- lagrangian relaxation
- objective function
- search algorithm
- dynamic programming
- worst case
- optimization problems
- max sat
- lower and upper bounds
- heuristic search
- root node
- linear programming
- sat solving
- lp relaxation
- cutting plane
- b tree
- column generation
- piecewise linear
- sat solvers
- integer programming
- greedy algorithm