Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem.
Alexey NikolaevMikhail BatsynPublished in: IWOCA (2018)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- np hard
- quadratic assignment problem
- optimal solution
- lower bounding
- test problems
- precedence constraints
- combinatorial optimization
- randomly generated problems
- upper bounding
- mixed integer linear programming
- single machine scheduling problem
- variable ordering
- branch and bound method
- max sat
- lagrangian relaxation
- genetic algorithm
- knapsack problem
- maximum clique
- integer variables
- linear program
- finding an optimal solution