Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
| Year of publication: |
16 April 2018
|
|---|---|
| Authors: | Gschwind, Timo ; Irnich, Stefan ; Rothenbächer, Ann-Kathrin ; Tilk, Christian |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 266.2018, 2 (16.4.), p. 521-530
|
| Subject: | Routing | Pickup-and-delivery | Shortest-path problem with resource constraints | Bidirectional labeling | Column generation | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Theorie | Theory | Warenkennzeichnung | Product labelling |
-
A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
Marinho Damião, Caio, (2023)
-
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
Barbosa, Luiz Henrique, (2020)
-
The two-echelon vehicle routing problem with pickups, deliveries, and deadlines
Zamal, M. Arya, (2025)
- More ...
-
Tilk, Christian, (2017)
-
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
Gschwind, Timo, (2020)
-
A branch-and-price framework for decomposing graphs into relaxed cliques
Gschwind, Timo, (2021)
- More ...