>  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 0

작성자

  • GeorgeV
  •  (Gold) 1123 포인트
  • 100% positive feedback
© 2024 CSOFT International, Ltd.