A Multi-Thread Branch-and-Bound Algorithm for the Traveling Salesperson Problem.
Shyong Jian ShyuPublished in: PPSC (1999)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- upper bound
- optimal solution
- np hard
- search tree
- test problems
- precedence constraints
- lower bounding
- combinatorial optimization
- mixed integer linear programming
- randomly generated problems
- variable ordering
- upper bounding
- single machine scheduling problem
- finding an optimal solution
- max sat
- search algorithm
- lagrangian relaxation
- maximum clique
- metaheuristic
- integer variables
- computational complexity