Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm.
Aleksandr N. MaksimenkoPublished in: CoRR (2018)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- branch and bound algorithm
- optimal solution
- np hard
- dynamic programming
- lower bound
- ant colony optimization
- computational complexity
- discrete particle swarm optimization
- simulated annealing
- hamiltonian cycle
- test problems
- branch and bound
- finding an optimal solution
- search space
- hybrid algorithm
- convex hull
- upper bound
- cost function
- objective function
- knapsack problem
- single machine scheduling problem
- optimization problems