Gotta (efficiently) catch them all : Pokémon GO meets orienteering problems
Year of publication: |
1 March 2018
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Luipersbeck, Martin ; Sinnl, Markus |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 265.2018, 2 (1.3.), p. 779-794
|
Subject: | Combinatorial optimization | Orienteering Problem | Generalized traveling salesman problem | Integer programming | Branch-and-cut | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Yuan, Yuan, (2020)
-
A comprehensive survey on the generalized traveling salesman problem
Pop, Petrică C., (2024)
-
Yuan, Yuan, (2021)
- More ...
-
Solving minimum-cost shared arborescence problems
Álvarez-Miranda, Eduardo, (2017)
-
Álvarez-Miranda, Eduardo, (2017)
-
Leitner, Markus, (2018)
- More ...