… The primary purpose of this paper is to … , the problem is referred to as the covering salesman
problem (CSP) (CURRENTWI). This problem may be considered as a generalization of the …

… , the covering salesman problem (CSP) is to identify the minimum length tour “covering” all
the … Because the CSP and the generalized traveling salesman problem are special cases of …

… Otherwise, three or more covering lines are necessary, and the second step of our algorithm
… the point in which it intersects the covering lines. Note that by our construction of covering …

… length tour that visits each city once and returns back to the original city. In this work, we
focus on the covering salesman problem (CSP), which is a generalization of the TSP. In …

We consider a generalized version of the well known Traveling Salesman Problem called
Covering Salesman problem. In this problem, we are given a set of vertices while each vertex i …

… Motivated by delivery in urban traffic network, we studied the covering salesman problem
with online edge blockages, which has a wide application in operations society nowdays. For …

In this paper we develop a problem with potential applications in humanitarian relief
transportation and telecommunication networks. Given a set of vertices including the depot, facility …

… Covering salesman problem (CSP) is an extension of the popular traveling salesman problem
(… a predetermined coverage radius associated with each vertex, the goal of CSP is to find a …

… supply chain, a robust solution of the Covering Salesman Problem (CSP) is necessary. …
to cover a given customer (region of interest (ROI)). In this paper, we consider the coverage …

… The covering salesman problem (CSP) is an extension of the well-known traveling salesman
problem in … The goal of the CSP is to construct a minimum length Hamiltonian cycle over a …