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]

Authors

Stefan Bock

This author has not been identified. Look up 'Stefan Bock' in Google