A strengthened formulation and cutting planes for the open pit mine production scheduling problem.
Andreas BleyNatashia BolandChristopher FrickeGary FroylandPublished in: Comput. Oper. Res. (2010)
Keyphrases
- cutting plane
- scheduling problem
- open pit
- cutting plane algorithm
- mixed integer linear programming
- integer program
- mixed integer
- valid inequalities
- integer programming
- np hard
- mixed integer program
- production planning
- column generation
- single machine
- integer programming problems
- dantzig wolfe decomposition
- flowshop
- lower bound
- set partitioning
- tabu search
- knapsack problem
- linear programming relaxation
- feasible solution
- mixed integer programming
- production scheduling
- linear program
- optimal solution
- variational inequalities
- job shop scheduling problem
- lagrangian relaxation
- lot sizing
- search tree
- branch and bound
- simulated annealing
- special case