Avoiding redundant columns by adding classical Benders cuts to column generation subproblems.
Marco E. LübbeckeStephen J. MaherJonas T. WittPublished in: Discret. Optim. (2021)
Keyphrases
- column generation
- lagrangian relaxation
- linear programming
- branch and bound
- integer programming
- vehicle routing
- set partitioning
- dantzig wolfe decomposition
- linear program
- lagrangean relaxation
- constraint programming
- mixed integer programming
- integer linear programming
- integer program
- linear programming problems
- minimum cost
- exact solution
- np hard
- optimal solution
- cutting plane
- vehicle routing problem with time windows
- decomposition method
- cutting plane algorithm
- set covering
- linear programming relaxation
- search algorithm