A Parallel Branch and Bound Algorithm for the Probabilistic TSP.
Mohamed Abdellahi AmarWalid KhaznajiMonia BellalounaPublished in: ICA3PP (1) (2018)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- optimal solution
- np hard
- lower bound
- branch and bound
- traveling salesman problem
- test problems
- upper bound
- lower bounding
- search tree
- upper bounding
- single machine scheduling problem
- precedence constraints
- search space
- branch and bound method
- lagrangian relaxation
- variable ordering
- probabilistic model
- randomly generated problems
- max sat
- mixed integer linear programming
- finding an optimal solution
- metaheuristic
- objective function
- bayesian networks
- ant colony optimization
- optimization problems
- genetic algorithm
- lower and upper bounds
- parallel computing
- multi objective
- integer variables
- weighted max sat