The Covering Salesman Problem
- 1 August 1989
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 23 (3) , 208-213
- https://doi.org/10.1287/trsc.23.3.208
Abstract
The primary purpose of this paper is to introduce and mathematically formulate the covering salesman problem CSP. The CSP may be stated as follows: identify the minimum cost tour of a subset of n given cities such that every city not on the tour is within some predetermined covering distance standard, S, of a city that is on the tour. The CSP may be viewed as a generalization of the traveling salesman problem. A heuristic procedure for solving the CSP is presented and demonstrated with a sample problem.Keywords
This publication has 0 references indexed in Scilit: