Home > 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.
- Kalbos dalis: noun
- Pramonės šaka / sritis: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Kūrėjas
- GeorgeV
- 100% positive feedback