Login / Signup
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty.
Artur Alves Pessoa
Michael Poss
Ruslan Sadykov
François Vanderbeck
Published in:
Oper. Res. (2021)
Keyphrases
</>
robust optimization
cover inequalities
dynamic programming
knapsack problem
data mining
ant colony optimization
case study
image segmentation
optimal solution
search algorithm
multi objective
upper bound
decision makers
metaheuristic
uncertain data
robust estimation