Numerical Experience with Lower Bounds for MIQP Branch-And-Bound.
Roger FletcherSven LeyfferPublished in: SIAM J. Optim. (1998)
Keyphrases
- branch and bound
- lower bound
- upper bound
- branch and bound algorithm
- column generation
- randomly generated problems
- search algorithm
- optimal solution
- tree search
- branch and bound procedure
- np hard
- branch and bound method
- search space
- search strategies
- linear programming relaxation
- lower and upper bounds
- worst case
- tree search algorithm
- depth first search
- branch and bound search
- objective function
- combinatorial optimization
- max sat
- integer programming problems
- cutting plane
- cost function
- lagrangian heuristic
- partial solutions
- space complexity
- metaheuristic