Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios

Stefan Bock. Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios. European Journal of Operational Research, 283(3):863-882, 2020. [doi]

@article{Bock20-0,
  title = {Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios},
  author = {Stefan Bock},
  year = {2020},
  doi = {10.1016/j.ejor.2019.11.058},
  url = {https://doi.org/10.1016/j.ejor.2019.11.058},
  researchr = {https://researchr.org/publication/Bock20-0},
  cites = {0},
  citedby = {0},
  journal = {European Journal of Operational Research},
  volume = {283},
  number = {3},
  pages = {863-882},
}