Shipment planning at oil refineries using column generation and valid inequalities.
Jan A. PerssonMaud Göthe-LundgrenPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- column generation
- valid inequalities
- mixed integer programming
- integer programming
- integer program
- cutting plane
- linear programming
- cutting plane algorithm
- branch and bound
- linear programming relaxation
- vehicle routing problem with time windows
- linear program
- set partitioning
- vehicle routing
- lagrangian relaxation
- linear relaxation
- optimal solution
- exact solution
- constraint programming
- heuristic search
- production planning
- np hard
- feasible solution
- upper bound
- lower and upper bounds
- traveling salesman problem
- lower bound