Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Year of publication: |
2020
|
---|---|
Authors: | Desaulniers, Guy ; Gschwind, Timo ; Irnich, Stefan |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 54.2020, 5, p. 1170-1188
|
Subject: | integer programming | branch price and cut | variable fixing | vehicle routing | labeling algorithm | Theorie | Theory | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming |
-
Branch-and-price algorithm for the location-routing problem with time windows
Ponboon, Sattrawut, (2016)
-
Formulation and algorithms for route planning problem of plug-in hybrid electric vehicles
Murakami, Keisuke, (2018)
-
Bianchessi, Nicola, (2024)
- More ...
-
Dual Inequalities for Stabilized Column Generation Revisited
Gschwind, Timo, (2014)
-
Stabilized Column Generation for the Temporal Knapsack Problem using Dual- Optimal Inequalities
Gschwind, Timo, (2014)
-
A note on symmetry reduction for circular traveling tournament problems
Gschwind, Timo, (2011)
- More ...