Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem.
Francesco CarrabsCarmine CerroneRaffaele CerulliCiriaco D'AmbrosioPublished in: GPC (2017)
Keyphrases
- traveling salesman problem
- upper and lower bounds
- upper bound
- lower bound
- combinatorial optimization
- ant colony optimization
- optimization problems
- ant colony optimization algorithm
- lower and upper bounds
- discrete optimization problems
- sample complexity
- genetic local search
- hamiltonian cycle
- valid inequalities
- subtour elimination
- traveling salesman
- reinforcement learning
- metaheuristic
- pairwise
- genetic algorithm