Incorporating holding costs in continuous-time service network design : new model, relaxation, and exact algorithm
Year of publication: |
2024
|
---|---|
Authors: | Shu, Shengnan ; Xu, Zhou ; Baldacci, Roberto |
Subject: | dynamic discretization discovery | holding cost | programming - integer - algorithms | service network design | transportation | Theorie | Theory | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem |
-
Ghaffarinasab, Nader, (2018)
-
Lagrange dual bound computation for stochastic service network design
Jiang, Xiaoping, (2022)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
- More ...
-
Optimal Global Liner Service Procurement by Utilizing Liner Service Schedules
Lee, ChungâYee, (2020)
-
A new exact algorithm for single-commodity vehicle routing with split pickups and deliveries
Li, Jiliu, (2023)
-
The Rollon-Rolloff Vehicle Routing Problem
Bodin, Lawrence, (2000)
- More ...