Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm

Albiach, 2008, An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation, European J. Oper. Res., 189, 789, 10.1016/j.ejor.2006.09.099

Arigliano, 2018, A branch-and-bound algorithm for the time-dependent travelling salesman problem, Networks, 72, 382, 10.1002/net.21830

Ascheuer, 2001, Solving the asymmetric travelling salesman problem with time windows by branch-and-cut, Math. Program., 90, 475, 10.1007/PL00011432

Corberán, 2005, New results on the mixed general routing problem, Oper. Res., 53, 363, 10.1287/opre.1040.0168

Corberán, 2007, A branch & cut algorithm for the windy general routing problem and special cases, Networks, 49, 245, 10.1002/net.20176

Cordeau, 2014, Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem, Transp. Sci., 48, 46, 10.1287/trsc.1120.0449

Dabia, 2013, Branch and price for the time-dependent vehicle routing problem with time windows, Transp. Sci., 47, 380, 10.1287/trsc.1120.0445

Gendreau, 2015, Time-dependent routing problems: A review, Comput. Oper. Res., 64, 189, 10.1016/j.cor.2015.06.001

Ghiani, 2014, A note on the Ichoua, Gendreau, and Potvin (2003) travel time model, Transp. Sci., 48, 458, 10.1287/trsc.2013.0491

Ichoua, 2003, Vehicle dispatching with time-dependent travel times, European J. Oper. Res., 144, 379, 10.1016/S0377-2217(02)00147-9