A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet
| Year of publication: |
2020
|
|---|---|
| Authors: | Yuan, Yuan ; Cattaruzza, Diego ; Ogier, Maxime ; Semet, Frédéric |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 286.2020, 3 (1.11.), p. 849-866
|
| Subject: | Branch-and-cut | Delivery options | Generalized traveling salesman problem | Time-windows | Trunk delivery | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Heuristics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2020.04.024 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012291577