Bounds on the size of branch-and-bound proofs for integer knapsacks.
Bala KrishnamoorthyPublished in: Oper. Res. Lett. (2008)
Keyphrases
- branch and bound
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound search
- column generation
- optimal solution
- search algorithm
- lower and upper bounds
- search space
- combinatorial optimization
- beam search
- randomly generated problems
- branch and bound procedure
- max sat
- search strategies
- branch and bound method
- tree search
- worst case
- integer programming problems
- tree search algorithm
- linear programming relaxation
- lagrangian heuristic
- partial solutions
- knapsack problem
- np hard
- objective function
- network design problem
- lagrangian relaxation
- theorem prover
- linear programming
- neural network