论文信息 - An extension of Christofides heuristic to the k-person travelling salesman problem

An extension of Christofides heuristic to the k-person travelling salesman problem

Abstract Christofides heuristic is extended to the problem of finding a minimum length k-person tour of a complete graph using lengths that satisfy the triangular inequality. An approachable upper bound of 3 2 is demonstrated for the ratio of heuristic to optimum length solutions.

Alan Frieze | A. Frieze

[1] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[2] Chul E. Kim,et al. Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[3] D. J. Rosenkrantz,et al. Approximate Algorithms for the Traveling Salesperson Problem , 1974, SWAT.

[4] Greg N. Frederickson,et al. Approximation Algorithms for Some Postman Problems , 1979, JACM.

[5] F. Glover,et al. Finding Minimum Spanning Trees with a Fixed Number of Links at a Node , 1975 .

[6] G. L. Nemhauser,et al. Tight bounds for christofides' traveling salesman heuristic , 1978, Math. Program..