Given n cities, the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes, i.e. the minimum length tour visiting a subset of the n cities and such that each city not on the tour is within a predetermined...

The Covering Salesman Problem (CSP) is to identify the minimum length tour of a subset of n given cities such that each city not on the tour is within a predetermined distance from the nodes on the tour. In this paper we define and develop a...

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 can cover a subset of vertices within its predetermined covering...

villages which are not in the route, it is expected to go to

their nearest stop. So, they defined Covering Salesman Problem as that in which the goal is to find

the minimum length tour of a subset of n given cities, such that every city...

Given a graph , the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes. More specifically, it seeks the minimum length tour visiting a subset of the nodes in N such that each node i not on the tour...

Given n nodes, the covering salesman problem is to identify the minimum length tour

“covering” all the nodes, i.e. the minimum length tour visiting a subset of the n nodes and such that

each node not on the tour is within a...

In this paper we introduce the Generalized Covering Salesman Problem. A Variable Neighborhood Search Algorithm has been applied to solve the problem....

The covering salesman problem (CSP) is an extension of the well-known traveling salesman problem in which we are allowed to leave some vertices unvisited. The goal of the CSP is to construct a minimum length Hamiltonian cycle over a subset...

We introduce the time-constrained maximal covering routing problem -TCMCRP-, as a generalization of the covering salesman problem. In this problem, we are given a central depot, a set of facilities and several customers which are located within a...

We introduce the time constrained maximal covering salesman problem (TCMCSP) which is

the generalization of the covering salesman and orienting problems. In this problem, we are given

a set of vertices including a central depot...