Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios
Stefan Bock
| Year of publication: |
2020
|
|---|---|
| Authors: | Bock, Stefan |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 283.2020, 3 (16.6.), p. 863-882
|
| Subject: | Branch&Bound | Complexity analysis | Multiple scenarios | Scheduling | Versatile TSP approach | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Engpass | Bottleneck |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2019.11.058 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012171662