A column generation heuristic for a dynamic generalized assignment problem.
Luigi MocciaJean-François CordeauMaria Flavia MonacoMarcello SammarraPublished in: Comput. Oper. Res. (2009)
Keyphrases
- column generation
- lagrangean relaxation
- mixed integer programming
- integer linear programming
- optimal solution
- lagrangian relaxation
- set covering problem
- branch and bound
- linear programming
- set covering
- linear programming relaxation
- dantzig wolfe
- vehicle routing
- set partitioning
- integer programming
- linear program
- grasp with path relinking
- hybrid meta heuristic
- constraint programming
- linear programming problems
- dantzig wolfe decomposition
- complete search
- cutting plane
- lower bound
- search algorithm
- integer program
- combinatorial optimization
- linear relaxation
- np complete
- simulated annealing