References
Ascheuer N, Fischetti M, Grötschel M (2000) A polyhedral study of the asymmetric travelling salesman problem with time windows. Networks 36:69–79
Ascheuer N, Fischetti M, Grötschel M (2001) Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math Progr Ser A 90:475–506
Appelgren L (1969) A column generation approach for a ship scheduling problem. Transp Sci 3:53–68
Baldacci R, Mingozzi A, Roberti R (2012) New state-space relaxations for solving the traveling salesman problem with time windows. INFORMS J Comput 24:356–371
Dash S, Günlük O, Lodi A, Tramontani A (2012) A time bucket formulation for the traveling salesman problem with time windows. INFORMS J Comput 24:132–147
Hill A, Lalla-Ruiz E, Voß S, Goycoolea M (2018) A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem. J Sched. https://doi.org/10.1007/s10951-018-0578-9
Levin A (1971) Scheduling and fleet routing models for transportation systems. Transp Sci 5:232–255
Wang X, Regan AC (2009) On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints. Comput Ind Eng 56:161–164
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This comment refers to the invited paper available at https://doi.org/10.1007/s11750-019-00514-4.
Rights and permissions
About this article
Cite this article
Dash, S. Comments on: Perspectives on integer programming for time-dependent models. TOP 27, 174–177 (2019). https://doi.org/10.1007/s11750-019-00511-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-019-00511-7