Combining a Parallel Branch-and-Bound Algorithm with a Strong Heuristic to Solve the Sequential Ordering Problem.
Ghassan ShobakiTaspon GonggiatgulJacob NormingtonPinar Muyan-ÖzçelikPublished in: ICPP Workshops (2023)
Keyphrases
- branch and bound algorithm
- finding an optimal solution
- optimal solution
- mixed integer linear programming
- lower bound
- branch and bound
- lower bounding
- strongly np hard
- variable ordering
- combinatorial optimization
- exact methods
- set covering problem
- branch and bound method
- upper bound
- np hard
- lagrangian relaxation
- search tree
- precedence constraints
- upper bounding
- search algorithm
- randomly generated problems
- max sat
- integer variables
- metaheuristic
- single machine scheduling problem
- linear programming
- lower and upper bounds
- parallel computing
- weighted max sat
- heuristic methods
- neural network
- shared memory
- mathematical programming
- simulated annealing
- search space
- objective function