A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
Year of publication: |
16 April 2018
|
---|---|
Authors: | Liu, Tian ; Luo, Zhixing ; Hu, Qin ; Lim, Andrew |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 266.2018, 2 (16.4.), p. 487-497
|
Subject: | Cutting | Branch and cut | Polyhedral combinatorics | Two-echelon vehicle routing | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound | Kapazitätsplanung | Capacity planning |
-
Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
Pessoa, Artur, (2021)
-
A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem
Jepsen, Mads, (2013)
-
Akyüz, M. Hakan, (2014)
- More ...
-
On service consistency in multi-period vehicle routing
Luo, Zhixing, (2015)
-
Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
Luo, Zhixing, (2014)
-
Luo, Zhixing, (2016)
- More ...