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 | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm | Heuristik | Heuristics | Theorie | Theory | Ganzzahlige Optimierung | Integer programming |
-
Pereira, Armando H., (2018)
-
Sampaio, Afonso H., (2017)
-
Truck-drone hybrid delivery routing : payload-energy dependency and No-Fly zones
Jeong, Ho Young, (2019)
- More ...
-
Branch-and-cut algorithms for the p-arborescence star problem
Pereira, Armando Honorio, (2022)
-
Assunção, Lucas, (2021)
-
On the analysis of online and periodic virtual network embedding in multi-domain environments
Araújo, Samuel Moreira Abreu, (2021)
- More ...