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.
- Μέρος του λόγου: noun
- Κλάδος/Τομέας: Υπολογιστές
- Category: Αλγόριθμοι & δομές
- Government Agency: NIST
0
Δημιουργός
- GeorgeV
- 100% positive feedback