Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
1 answer
355 views

How do you traverse a rectangular grid of points while turning as little as possible?

Suppose I have a lattice grid of $m \times n$ points in the plane, with $m\leq n$. I want to traverse this grid in such a way as to minimize the total amount of turning that occurs. I am pretty sure ...
Tom Solberg's user avatar
  • 4,049
2 votes
2 answers
163 views

References for geometric properties of optimal Euclidean traveling salesman tour

Consider a finite set of points $V \subseteq \mathbb{R}^2 $ as a TSP-instance under the standard $\| \cdot \|_2$ norm. (TSP stands for traveling salesman tour.) We know that every optimal TSP tour $T$ ...
mc.math's user avatar
  • 29
2 votes
0 answers
119 views

Corporate salesman problem

A salesman is employed by a large corporation. He has a $n$ cities to visit, connected by roads, forming a graph. But as travel takes a lot of time, he has to pick hotels between visits. He cannot ...
kakaz's user avatar
  • 1,626