Dynamic programming for the minimum tour duration problem
| Year of publication: |
May 2017
|
|---|---|
| Authors: | Tilk, Christian ; Irnich, Stefan |
| Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 51.2017, 2, p. 549-565
|
| Subject: | traveling salesman problem | time windows | tour duration | dynamic programming | state-space relaxation | Dynamische Optimierung | Dynamic programming | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Dauer | Duration | Mathematische Optimierung | Mathematical programming |
-
Dynamic programming for the time-dependent traveling salesman problem with time windows
Lera-Romero, Gonzalo, (2022)
-
Exact methods for the traveling salesman problem with drone
Roberti, Roberto, (2021)
-
Urrutia, Sebastián, (2015)
- More ...
-
Tilk, Christian, (2019)
-
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
Gschwind, Timo, (2018)
-
Combined column-and-row-generation for the optimal communication spanning tree problem
Tilk, Christian, (2018)
- More ...