Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
Year of publication: |
2021
|
---|---|
Authors: | Pessoa, Artur ; Poss, Michael ; Sadykov, Ruslan ; Vanderbeck, François |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 69.2021, 3, p. 739-754
|
Subject: | branch-cut-and-price | robust optimization | capacity inequalities | local search | vehicle routing | Tourenplanung | Vehicle routing problem | Theorie | Theory | Heuristik | Heuristics | Robustes Verfahren | Robust statistics | Kapazitätsplanung | Capacity planning |
-
Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
Thiebaut, Karina, (2023)
-
Subramanyam, Anirudh, (2020)
-
Solving the bi-objective robust vehicle routing problem with uncertain costs and demands
Solano-Charris, Elyn L., (2016)
- More ...
-
Primal heuristics for branch and price : the assets of diving methods
Sadykov, Ruslan, (2019)
-
Automation and combination of linear-programming based stabilization techniques in column generation
Pessoa, Artur, (2018)
-
Robust network design with uncertain outsourcing cost
Pessoa, Artur, (2015)
- More ...