A railroad maintenance problem solved with a cut and column generation matheuristic.
Sébastien LannezChristian ArtiguesJean DamayMichel GendreauPublished in: Networks (2015)
Keyphrases
- column generation
- integer program
- branch and bound
- linear program
- linear programming
- integer programming
- mixed integer programming
- integer linear programming
- constraint programming
- lagrangean relaxation
- trust region
- vehicle routing
- exact solution
- set partitioning
- cutting plane
- optimal solution
- lagrangian relaxation
- linear programming problems
- set covering
- vehicle routing problem with time windows
- linear programming relaxation
- valid inequalities
- neural network
- lower bound
- dantzig wolfe decomposition
- lp relaxation
- cutting plane algorithm
- special case