All Questions
Tagged with traveling-salesman-problem computer-science
1 question
3
votes
1
answer
262
views
What is known about this TSP variant?
Euclidian (planar) TSP asks for a tour with the minimum total length. The problem is known to be NP-hard. I am interested in the variant of finding a closed tour with the minimum enclosed area (...
- 2,993