A parallel branch-and-bound algorithm with history-based domination and its application to the sequential ordering problem.
Taspon GonggiatgulGhassan ShobakiPinar Muyan-ÖzçelikPublished in: J. Parallel Distributed Comput. (2023)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- lower bounding
- optimal solution
- np hard
- search tree
- test problems
- precedence constraints
- parallel version
- randomly generated problems
- combinatorial optimization
- variable ordering
- upper bounding
- lagrangian relaxation
- mixed integer linear programming
- single machine scheduling problem
- search algorithm
- max sat
- branch and bound method
- finding an optimal solution
- mathematical programming
- integer variables
- column generation
- parallel algorithm
- maximum clique
- scheduling problem