Branch and Bound Algorithm Selection by Performance Prediction.
Lionel LobjoisMichel LemaîtrePublished in: AAAI/IAAI (1998)
Keyphrases
- optimization problems
- branch and bound algorithm
- combinatorial optimization
- test problems
- evolutionary algorithm
- branch and bound
- lower bound
- lower bounding
- upper bound
- optimal solution
- search tree
- precedence constraints
- upper bounding
- randomly generated problems
- np hard
- knapsack problem
- lagrangian relaxation
- single machine scheduling problem
- finding an optimal solution
- variable ordering
- mixed integer linear programming
- max sat
- search space
- linear programming
- bayesian networks
- search algorithm
- simulated annealing