Nonexistence of a Universal Algorithm for Traveling Salesman Problems in Constructive Mathematics.
Linglong DaiPublished in: SAI (1) (2022)
Keyphrases
- hamiltonian cycle
- traveling salesman problem
- cost function
- np hard
- similarity measure
- segmentation algorithm
- dynamic programming
- computational complexity
- optimization algorithm
- ant colony optimization
- objective function
- search space
- probabilistic model
- particle swarm optimization
- combinatorial optimization
- graph structure
- neural network