Fast Branch and Bound Algorithm for the Travelling Salesman Problem.
Radoslaw GryminSzymon JagielloPublished in: CISIM (2016)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- quadratic assignment problem
- upper bound
- np hard
- combinatorial optimization
- optimal solution
- test problems
- lower bounding
- randomly generated problems
- precedence constraints
- upper bounding
- single machine scheduling problem
- lagrangian relaxation
- variable ordering
- mixed integer linear programming
- search algorithm
- genetic algorithm
- max sat
- lp relaxation
- distance function
- integer variables