Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
| Year of publication: |
2015
|
|---|---|
| Authors: | Gendreau, Michel ; Nossack, Jenny ; Pesch, Erwin |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 242.2015, 3 (1.5.), p. 1008-1016
|
| Subject: | Pickup and delivery problem | Asymmetric traveling salesman problem | Classical Benders decomposition | Generalized Benders decomposition | Dekompositionsverfahren | Decomposition method | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming |
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
Aguayo, Maichel M., (2018)
-
An exact approach for solving pickup-and-delivery traveling salesman problems with neighborhoods
Gao, Cai, (2023)
- More ...
-
Good Laboratory Practice for optimization research
Kendall, Graham, (2016)
-
Kress, Dominik, (2018)
-
Container dispatching and conflict-free yard crane routing in an automated container terminal
Nossack, Jenny, (2018)
- More ...