A column generation approach and new bounds for the car sequencing problem.
Eivind JahrenRoberto Javier Asín AcháPublished in: Ann. Oper. Res. (2018)
Keyphrases
- column generation
- branch and bound
- linear relaxation
- lower bound
- upper bound
- linear programming
- linear program
- set partitioning
- integer programming
- optimal solution
- vehicle routing
- cutting plane
- integer program
- integer linear programming
- lagrangean relaxation
- exact solution
- constraint programming
- set covering problem
- mixed integer programming
- linear programming problems
- set covering
- lower and upper bounds
- valid inequalities
- linear programming relaxation
- worst case
- vehicle routing problem with time windows
- cutting plane algorithm
- dantzig wolfe decomposition
- neural network
- np hard
- search space
- search algorithm
- minimum cost
- feasible solution
- multi objective
- grasp with path relinking