Exact solution of the soft-clustered vehicle-routing problem
Year of publication: |
2020
|
---|---|
Authors: | Hintsch, Timo ; Irnich, Stefan |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 280.2020, 1 (1.1.), p. 164-178
|
Subject: | Branch-and-cut | Branch-and-price | Dynamic-programming labeling | Routing | Shortest-path problem with resource constraints | Tourenplanung | Vehicle routing problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
The min-max close-enough arc routing problem
Bianchessi, Nicola, (2022)
-
Branch-and-price and constraint programming for solving real-life technician dispatching problem
Cortés, Cristian E., (2014)
-
The pollution-routing problem with speed optimization and uneven topography
Lai, David, (2024)
- More ...
-
Large multiple neighborhood search for the clustered vehicle-routing problem
Hintsch, Timo, (2018)
-
Branch-price-and-cut for the soft-clustered capacitated arc-routing problem
Hintsch, Timo, (2021)
-
Large multiple neighborhood search for the soft-clustered vehicle-routing problem
Hintsch, Timo, (2021)
- More ...