New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Year of publication: |
January-March 2017
|
---|---|
Authors: | Sampaio, Afonso H. ; Urrutia, Sebastián |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 24.2017, 1/2, p. 77-98
|
Subject: | integer programming | transportation | traveling salesman | valid inequalities | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Truck-drone hybrid delivery routing : payload-energy dependency and No-Fly zones
Jeong, Ho Young, (2019)
-
Pereira, Armando Honorio, (2022)
-
Pereira, Armando H., (2018)
- More ...
-
Gamma deployment problem in grids : hardness and new integer linear programming formulation
Faraj, Marcelo Fonseca, (2019)
-
Branch‐and‐cut algorithms for the ‐arborescence star problem
Pereira, Armando Honorio, (2020)
-
Scheduling in sports : an annotated bibliography
Kendall, Graham, (2010)
- More ...