1 April 1994 in European Journal of Operational Research
9 March 2009 in Journal of Operations Management
1 December 1990 in European Journal of Operational Research
1 August 1989 in Transportation Science
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.
1 May 1979 in Transportation Science
A number of new location models which utilize the notion of coverage were developed, tested and utilized in a study of the Baltimore City Fire Protection System. These models extend the location decision to include not only specification of the sites of the basic facilities but also the distribution of specialized equipment and/or manpower among those sites. They are seen as more realistic representations of the location decisions which are required in public sector applications.
1 January 1997 in European Journal of Operational Research