A minmax regret approach for a time-dependent version of the Traveling Salesman and Shortest Path Problems Conference Paper 2019 Congress communication