Sutcliffe, Paul; Solomon, Andrew; Edwards, Jenny - In: Computational Optimization and Applications 53 (2012) 3, pp. 711-728
We give an <Emphasis FontCategory="SansSerif">O(n <Superscript>2</Superscript>) time algorithm to find the population variance of tour costs over the solution space of the n city symmetric Traveling Salesman Problem (TSP). The algorithm has application in both the stochastic case, where the problem is specified in terms of edge costs which are pairwise...</superscript></emphasis>