Keyphrases
- lower bound
- upper bound
- optimal solution
- average case complexity
- branch and bound
- knapsack problem
- branch and bound algorithm
- search algorithm
- lower and upper bounds
- np hard
- constraint satisfaction
- objective function
- search space
- worst case
- tree search
- upper and lower bounds
- dynamic programming
- greedy heuristic
- dependency directed backtracking
- search tree
- vc dimension
- online algorithms
- feasible solution
- lower bounding
- sufficiently accurate
- sample complexity
- constraint propagation
- neural network
- average case
- lagrangian relaxation
- convergence rate
- linear programming relaxation
- polynomial approximation
- linear programming
- special case
- random constraint satisfaction problems