An Improved Upper Bound for the Universal TSP on the Grid.
George ChristodoulouAlkmini SgouritsaPublished in: SODA (2017)
Keyphrases
- upper bound
- lower bound
- traveling salesman problem
- branch and bound
- branch and bound algorithm
- optimal solution
- worst case
- travelling salesman
- grid points
- ant colony optimization
- upper and lower bounds
- lower and upper bounds
- combinatorial optimization
- np hard
- grid computing
- error probability
- genetic algorithm
- generalization error
- grid environment
- computational grids
- information retrieval
- information systems
- multi valued
- aco algorithms
- neural network