A branch and bound algorithm for the probabilistic traveling salesman problem.
Soumaya Sassi MahfoudhWalid KhaznajiMonia BellalounaPublished in: SNPD (2015)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- test problems
- upper bound
- randomly generated
- np hard
- lower bounding
- optimal solution
- combinatorial optimization
- precedence constraints
- randomly generated problems
- search tree
- single machine scheduling problem
- mixed integer linear programming
- max sat
- variable ordering
- upper bounding
- maximum clique
- branch and bound method
- lagrangian relaxation
- finding an optimal solution
- search space
- objective function
- network design problem
- column generation
- search algorithm
- optimization problems
- constraint satisfaction problems