On the neutrality of two symmetric TSP solvers toward instance specification.
Gloria Cerasela CrisanLászló Barna IantovicsLászló KovácsPublished in: Sci. China Inf. Sci. (2019)
Keyphrases
- traveling salesman problem
- sat instances
- travelling salesman
- sat solvers
- np hard
- data sets
- optimal solution
- ant colony optimization
- combinatorial optimization
- neural network
- genetic algorithm
- database
- optimization problems
- satisfy the triangle inequality
- computationally hard problems
- randomly generated
- constraint satisfaction
- lower bound