An approximation algorithm for the TSP (Q1119485)

For a given complete weighted graph with n nodes, the authors present a heuristic algorithm with running time \(O(n^ 4)\) for the travelling salesman problem. Experimental studies show that the method gives better results in most cases than the well-known Quick method.