An exact approach for solving pickup-and-delivery traveling salesman problems with neighborhoods
Year of publication: |
2023
|
---|---|
Authors: | Gao, Cai ; Wei, Ningji ; Walteros, Jose L. |
Subject: | close-enough traveling salesman problem | generalized Benders decomposition | mixed-integer nonlinear programing | transportation and logistics | UAV routing | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Dekompositionsverfahren | Decomposition method | Logistik | Logistics |
-
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
Gendreau, Michel, (2015)
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
Gołąbek, Łukasz, (2021)
- More ...
-
Integer programming formulations for minimum spanning tree interdiction
Wei, Ningji, (2021)
-
Integer programming methods for solving binary interdiction games
Wei, Ningji, (2022)
-
Weighted k-shell decomposition for complex networks based on potential edge weights
Wei, Bo, (2015)
- More ...