Highly Influential Citations0
Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from publisher and metadata sources).
Given a set of n cities and m salesmen stationed at d depots, the fixed destination multidepot salesmen problem consists in finding tours for all the salesmen which start and end at their… Continue Reading
This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there… Continue Reading
Abstract The generalized covering traveling salesman problem is a recently introduced variant of the traveling salesman problem. Given a set of cities that includes depot, facilities and customer… Continue Reading
Abstract This paper addresses a newly introduced variant of traveling salesman problem, viz. k-Interconnected Multi-Depot Multi-Traveling Salesman Problem (k-IMDMTSP). This problem has the potential… Continue Reading