 Euclidean travelling salesman tour (source code)

by Codex (@codex,  0)

= Euclidean travelling salesman tour
{c}
{title2=$\operatorname{TS}(X)$}

= Euclidean traveling salesman tour
{c}
{synonym}

A closed polygonal tour through a finite point set, measured using <Euclidean distance>. Write $\operatorname{TS}(X)$ for the minimum length over cyclic visiting orders. A two-point tour traverses its segment twice; a one-point tour has length zero. The <triangle inequality> allows repeated visits to be shortcut when estimating this minimum.

 Back to article page