Mixed integer programming formulations for the generalized traveling salesman problem with time windows
Year of publication: |
2021
|
---|---|
Authors: | Yuan, Yuan ; Cattaruzza, Diego ; Ogier, Maxime ; Rousselot, Cyriaque ; Semet, Frédéric |
Published in: |
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies. - Berlin : Springer, ISSN 1614-2411, ZDB-ID 2106212-2. - Vol. 19.2021, 4, p. 571-592
|
Subject: | Generalized traveling salesman problem | Time windows | Mixed integer programming formulations | Last mile delivery | Tourenplanung | Vehicle routing problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Rundreiseproblem | Travelling salesman problem |
-
Gotta (efficiently) catch them all : Pokémon GO meets orienteering problems
Álvarez-Miranda, Eduardo, (2018)
-
An integer programming approach for the time-dependent traveling salesman problem with time windows
Montero, Agustín, (2017)
-
A traveling salesman problem with time windows for the last mile delivery in online shopping
Jiang, Li, (2020)
- More ...
-
A column generation based heuristic for the generalized vehicle routing problem with time windows
Yuan, Yuan, (2021)
-
Yuan, Yuan, (2020)
-
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Yuan, Yuan, (2020)
- More ...