A column generation heuristic for districting the price of a financial product.
Pierre de la Poix de FréminvilleGuy DesaulniersLouis-Martin RousseauSylvain PerronPublished in: J. Oper. Res. Soc. (2015)
Keyphrases
- column generation
- lagrangean relaxation
- integer linear programming
- optimal solution
- mixed integer programming
- lagrangian relaxation
- branch and bound
- set covering problem
- set covering
- grasp with path relinking
- linear program
- linear programming relaxation
- dantzig wolfe
- linear programming
- integer programming
- hybrid meta heuristic
- integer program
- beam search
- set partitioning
- vehicle routing
- complete search
- exact solution
- search algorithm
- cutting plane
- vehicle routing problem with time windows
- constraint programming
- combinatorial optimization
- production planning
- linear programming problems
- lower bound
- branch and bound algorithm
- dynamic programming
- dantzig wolfe decomposition
- path relinking
- metaheuristic
- cutting plane algorithm
- search strategies
- valid inequalities
- objective function