In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time...

We define the \emph{adjacent vertex distinguishing sum edge coloring problem}. This problem consists in finding an assignment of colors to the edges of a graph with the following constraints: every pair of adjacent edges must have a different color, and every pair of adjacent vertices must not...