Skip to main content
Log in

Rejoinder on: Perspectives on integer programming for time-dependent models

  • Discussion
  • Published:
TOP Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

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)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Natashia L. Boland.

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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-019-00513-5

Navigation