An extension of Christofides heuristic to the k-person travelling salesman problem
From MaRDI portal
Publication:1838426
DOI10.1016/0166-218X(83)90102-6zbMath0508.90085WikidataQ57401635 ScholiaQ57401635MaRDI QIDQ1838426
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
upper boundapproximation algorithmcomplete graphChristofides heuristick-person travelling salesmanminimum length k- person tour
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items
Approximation algorithms for the Geometric Covering Salesman Problem, An overview of graph covering and partitioning, Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties, Approximation algorithms for multiple terminal, Hamiltonian path problems, On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
Cites Work
