In this paper, we propose a new method for partitioning a graph into an unspecified number of Hamiltonian subgraphs with minimum and maximum size requirements on the subgraphs. We refer to this problem as the cardinality constrained covering traveling salesman problem (CCC-TSP). Special cases of...

Drones attract increasing attention in the last decades as a means for last mile delivery; they are mainly considered as supplement delivery tools that work jointly with trucks. In this paper, we develop a Covering Salesman Problem with Nodes and Segments Using Drones (CSPNS-D) and formulate...

This paper analizes a new variant of the Traveling Salesman Problem (TSP) in which nodes belong to various color classes and each color class must be visited as an entity. We show that the problem is APX-hard and provide exact solutions for special cases and a two-phase heuristic for the general...

Here, we present a new arc-based formulation for the Asymmetric Traveling Salesman Problem with Replenishment Arcs, which is an extension of the Asymmetric Traveling Salesman Problem, with constraints on subpaths of the tour. This problem is commonly modeled using a path-based formulation which...