Equidistribution of Point Sets for the Traveling Salesman and Related Problems

摘要

This paper deals with worst-case arrangement of points for problems incombinatorial optimization; it is shown that these point sets are equidistributed. For specificity, we concentrate on the Traveling Salesman Problem.