References
He E, Boland N, Nemhauser G, Savelsbergh M (2019) Dynamic discretization discovery algorithms for time-dependent shortest path problems. Optimization Online 2019–7082
Vu DM, Boland N, Hewitt M, Savelsbergh M (2018) Solving time dependent traveling salesman problems with time windows. Optimization Online 2018–6640 (to appear in Transportation Science)
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 rejoinder refers to the comments available at https://doi.org/10.1007/s11750-019-00510-8, https://doi.org/10.1007/s11750-019-00511-7, https://doi.org/10.1007/s11750-019-00512-6.
Rights and permissions
About this article
Cite this article
Boland, N.L., Savelsbergh, M.W.P. Rejoinder on: Perspectives on integer programming for time-dependent models. TOP 27, 184–186 (2019). https://doi.org/10.1007/s11750-019-00513-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-019-00513-5