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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.