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 |
-
Aguayo, Maichel M., (2018)
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
An exact approach for solving pickup-and-delivery traveling salesman problems with neighborhoods
Gao, Cai, (2023)
- More ...
-
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
Gendreau, Michel, (2015)
-
Minimizing setup costs in a transfer line design problem with sequential operation processing
Dolgui, Alexandre, (2014)
-
A truck scheduling problem arising in intermodal container transportation
Nossack, Jenny, (2013)
- More ...