A note on finding a shortest complete cycle in an undirected graph
How to transform a shortest complete cycle problem into a traveling salesman problem is well known. Although these problems appear ill- conditioned, a 1-tree relaxation based traveling salesman algorithm solves them rather easily (up to 150 nodes), provided non-optimal edges are eliminated. The computational results are considerably better than known results for a linear programming approach.
scientific article; zbMATH DE number 3934805
scientific article