Inicio > Term: Euclidean traveling salesman problem
Euclidean traveling salesman problem
Find a path of minimum Euclidean distance between points in a plane which includes each point exactly once and returns to its starting point.
- Parte del discurso: noun
- Industria/ámbito: Ciencia informática
- Categoría: Algoritmos & Estructura de Datos
- Government Agency: NIST
0
Creador
- GeorgeV
- 100% positive feedback