On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints

Appelgren, 1969, A column generation approach for a ship scheduling problem, Transportation Science, 3, 53, 10.1287/trsc.3.1.53 Appelgren, 1971, Integer programming methods for a vessel scheduling problem, Transportation Science, 5, 62, 10.1287/trsc.5.1.64 Bard, 2002, A branch-and-cut procedure for the vehicle routing problem with time windows, Transportation Science, 36, 250, 10.1287/trsc.36.2.250.565 Belenguer, 2000, A lower bound for the split delivery vehicle routing problem, Operations Research, 48, 801, 10.1287/opre.48.5.801.12407 Hane, 1995, Fleet assignment problem: Solving a large scale integer problem, Mathematical Programming, 70, 211, 10.1007/BF01585938 Jarrah, 2000, An efficient airline re-fleeting model for the incremental modification of planned fleet assignments, Transportation Science, 34, 363, 10.1287/trsc.34.4.349.12324 Langevin, 1990, Classification of traveling salesman problem formulations, Operations Research Letters, 9, 127, 10.1016/0167-6377(90)90052-7 Levin, 1971, Scheduling and fleet routing models for transportation systems, Transportation Science, 5, 232, 10.1287/trsc.5.3.232 Swersey, 1984, Scheduling school buses, Management Science, 30, 844, 10.1287/mnsc.30.7.844 Wang, 2002, Local truckload pickup and delivery with hard time window constraints, Transportation Research, Part B, 36, 97, 10.1016/S0965-8564(00)00037-9