The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm.
Aleksandr N. MaksimenkoPublished in: Autom. Control. Comput. Sci. (2021)
Keyphrases
- combinatorial optimization
- branch and bound algorithm
- traveling salesman problem
- optimal solution
- test problems
- hamiltonian cycle
- ant colony optimization
- np hard
- branch and bound
- dynamic programming
- cost function
- single machine scheduling problem
- search space
- computational complexity
- finding an optimal solution
- traveling salesman
- lower bounding
- precedence constraints
- lagrangian relaxation
- discrete particle swarm optimization
- particle swarm optimization
- metaheuristic
- neural network
- linear programming
- optimization problems
- simulated annealing
- upper bound
- scheduling problem
- lower bound
- search algorithm
- similarity measure