Improved branching disjunctions for branch-and-bound: An analytic center approach.
Samir ElhedhliJoe Naoum-SawayaPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- scheduling problem
- branch and bound
- lower bound
- linear programming relaxation
- branch and bound algorithm
- search algorithm
- column generation
- search space
- optimal solution
- upper bound
- combinatorial optimization
- branch and bound procedure
- tree search
- cutting plane method
- max sat
- linear programming
- denoising
- genetic algorithm
- metaheuristic
- version space