Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Year of publication: |
2022
|
---|---|
Authors: | Pereira, Armando Honorio ; Mateus, Geraldo R. ; Urrutia, Sebastián Alberto |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 300.2022, 1 (1.7.), p. 207-220
|
Subject: | Branch-and-cut | Combinatorial optimization | Multiple stacks | Pickup and delivery | Traveling salesman | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Pereira, Armando H., (2018)
-
Han, Lanshan, (2016)
-
The traveling salesman problem with pickups, deliveries, and draft limits
Malaguti, Enrico, (2018)
- More ...
-
Branch-and-cut algorithms for the p-arborescence star problem
Pereira, Armando Honorio, (2022)
-
Branch‐and‐cut algorithms for the ‐arborescence star problem
Pereira, Armando Honorio, (2020)
-
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Valle, Cristiano Arbex, (2011)
- More ...