Continuous Relaxations for the Traveling Salesman Problem.
Tuhin SahaiStefan KlusMichael DellnitzPublished in: CoRR (2017)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- optimization problems
- combinatorial problems
- discrete particle swarm optimization
- valid inequalities
- hamiltonian cycle
- discrete optimization problems
- ant colony optimization algorithm
- genetic local search
- combinatorial optimization problems
- traveling salesman
- linear programming
- linear programming relaxation
- transportation networks
- vehicle routing problem
- np hard
- lower bound
- neural network
- global optimization
- branch and bound
- metaheuristic
- evolutionary algorithm