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 | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics |
-
Pereira, Armando Honorio, (2022)
-
Truck-drone hybrid delivery routing : payload-energy dependency and No-Fly zones
Jeong, Ho Young, (2019)
-
Silva, Bruno C. H., (2020)
- 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)
-
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
Ribeiro, Celso C., (2008)
- More ...