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 | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
Balma, Ali, (2018)
-
Load-dependent and precedence-based models for pickup and delivery problems
Gouveia, Luis, (2015)
- More ...
-
Multiple hypernode hitting sets and smallest two-cores with targets
Damaschke, Peter, (2009)
- More ...