A parallel branch-and-bound algorithm with history-based domination.
Taspon GonggiatgulGhassan ShobakiPinar Muyan-ÖzçelikPublished in: PPoPP (2022)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- np hard
- lower bounding
- optimal solution
- test problems
- combinatorial optimization
- search tree
- precedence constraints
- randomly generated problems
- branch and bound method
- single machine scheduling problem
- upper bounding
- mixed integer linear programming
- lagrangian relaxation
- finding an optimal solution
- search algorithm
- max sat
- integer variables
- column generation
- shared memory
- variable ordering
- linear programming
- search space
- neural network