A Java Implementation of the Branch and Bound Algorithm : the Probabilistic Traveling Salesman Problem.
Soumaya Sassi MahfoudhWalid KhaznajiMonia BellalounaPublished in: CTW (2015)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- np hard
- upper bound
- optimal solution
- search tree
- test problems
- randomly generated problems
- single machine scheduling problem
- combinatorial optimization
- lower bounding
- max sat
- precedence constraints
- lagrangian relaxation
- variable ordering
- java virtual machine
- search algorithm
- java programs
- mixed integer linear programming
- network design problem
- computational complexity
- branch and bound method
- finding an optimal solution