首页 > 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.
0
创建者
- GeorgeV
- 100% positive feedback