A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
Year of publication: |
2014
|
---|---|
Authors: | Lysgaard, Jens ; Wøhlk, Sanne |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 236.2014, 3 (1.8.), p. 800-810
|
Subject: | Routing | Minimum latency | CCVRP | Branch-and-cut-and-price | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Heuristics |
-
A tabu search algorithm for the multi-period inspector scheduling problem
Qin, Hu, (2015)
-
Domínguez Rivero, Oscar L., (2016)
-
A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
Malheiros, Igor, (2021)
- More ...
-
A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
Christiansen, Christian H., (2009)
-
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands
Christiansen, Christian H., (2009)
-
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands
Christiansen, Christian H., (2009)
- More ...