Karg, Robert L.; Thompson, Gerald L. - In: Management Science 10 (1964) 2, pp. 225-248
A code for solving travelling salesman problem employing heuristic ideas is described. Acyclic permutations of the cities are constructed by first choosing two cities at random for a permutation of length two, putting the remaining cities in a random list and then inserting cities from the list...