Travelling salesman problem with maximum day length and start/end day at a specific node

Question

The Traveling Salesman Problem (TSP) is stated as follows:

• Let a directed graph G = (V, E) be given, where V = {1, ..., n} is a set of nodes, E <= V x V is a