ホーム > 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
- 産業/ドメイン コンピュータサイエンス
- カテゴリ Algorithms & data structures
- Government Agency: NIST
0
作成者
- GeorgeV
-
(Gold) 1123 ポイント - 100% positive feedback
