Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem
Year of publication: |
2020
|
---|---|
Authors: | Salman, Raad ; Ekstedt, Fredrik ; Damaschke, Peter |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 2, p. 163-166
|
Subject: | Assignment problem | Branch-and-bound | Generalized traveling salesman problem | Minimum spanning arborescence problem | Precedence constraints | Sequential ordering problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming |
-
Gotta (efficiently) catch them all : Pokémon GO meets orienteering problems
Álvarez-Miranda, Eduardo, (2018)
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
Solving the Traveling Salesman Problem with release dates via branch and cut
Montero, Agustín, (2023)
- More ...
-
Multiple hypernode hitting sets and smallest two-cores with targets
Damaschke, Peter, (2009)
- More ...