Tailored Lagrangian Relaxation for the open pit block sequencing problem.
W. Brian LambertAlexandra M. NewmanPublished in: Ann. Oper. Res. (2014)
Keyphrases
- lagrangian relaxation
- open pit
- integer programming
- feasible solution
- lower bound
- branch and bound algorithm
- dynamic programming
- column generation
- linear programming
- lower and upper bounds
- capacity constraints
- np hard
- lagrangian heuristic
- dual decomposition
- single machine scheduling problem
- network design problem
- relaxation algorithm
- mixed integer program
- mixed integer linear programs
- cutting plane algorithm
- subgradient method
- objective function
- shortest path
- upper bound
- mixed integer programming
- data structure
- dual variables
- genetic algorithm