This paper introduces an extension of the p-median problem and its application to clustering, in which the distance/dissimilarity function between units is calculated as the distance sum on the q most important variables. These variables are to be chosen from a set of m elements, so a new...

In this work, a new variant of the Capacitated Vehicle Routing Problem (CVRP) is presented where the vehicles cannot perform any route leg longer than a given length L (although the routes can be longer). Thus, once a route leg length is close to L, the vehicle must go to a stop node to end the...