Open-Pit Block-Sequencing Formulations: A Tutorial
References
- (2007) Constraint integer programming. Doctoral dissertation, Technical University Berlin, Berlin.Google Scholar
- (2009) A scalable approach to optimal block scheduling. Accessed October 1, 2013, http://mgoycool.uai.cl/papers/09amaya_apcom.pdf.Google Scholar
- AMPL (2009) AMPL: A modeling language for mathematical programming. Accessed October 1, 2013, www.ampl.com.Google Scholar
- (2005) Optimization Over Integers (Dynamic Ideas, Belmont, MA).Google Scholar
- (2007) Progress in computational mixed integer programming: A look back from the other side of the tipping point. Ann. Oper. Res. 149(1):37–41.Crossref, Google Scholar
- (2012) Clique-based facets for the precedence constrained knapsack problem. Math. Programming 133(1–2):481–511.Crossref, Google Scholar
- (2012) A new algorithm for the open-pit mine production scheduling problem. Oper. Res. 60(3):517–528.Link, Google Scholar
- (2011) A sliding time window heuristic for open pit mine block sequencing. Optim. Lett. 5(3):365–377.Crossref, Google Scholar
- (1986) Optimum open pit mine production scheduling by Lagrangian parameterization. Proc. 19th Internat. Appl. Comput. Oper. Res. Mineral Indust. (APCOM) Sympos. (Society for Mining, Metallurgy and Exploration, Littleton, CO), 127–141.Google Scholar
- (2007) A back to basics approach to mining strategy formulation. Accessed October 1, 2013, http://www.saimm.co.za/Conferences/HMC2007/173-178_deKock.pdf.Google Scholar
- (2013) Minelib 2011: A library of open pit production scheduling problems. Ann. Oper. Res. 206(1):93–114.Crossref, Google Scholar
- (2008) Methods for improving the tractability of the block sequencing problem for open pit mining. Doctoral dissertation, Colorado School of Mines, Golden, CO.Google Scholar
- IBM (2011) IBM ILOG CPLEX optimization studio v12.2. Accessed October 1, 2013, http://publib.boulder.ibm.com/infocenter/cosinfoc/v12r2/index.jsp/.Google Scholar
- (1968) Optimum open pit mine production scheduling. Doctoral dissertation, University of California, Berkeley.Crossref, Google Scholar
- (2013a) Practical guidelines for solving difficult linear programs. Surveys Oper. Res. Management Sci. 18(1–2):1–17.Crossref, Google Scholar
- (2013b) Practical guidelines for solving difficult mixed integer programs. Surveys Oper. Res. Management Sci. 18(1–2):18–32.Crossref, Google Scholar
- (2013) Tailored Lagrangian relaxation for the open pit block sequencing problem. Ann. Oper. Res.ePub ahead of print January 16, http://link.springer.com/article/10.1007/s10479-012-1287-y/fulltext.html.Google Scholar
- (1965) Optimum design of open-pit mines. Canadian Mining Metallurgical Bull. 58(633):47–54.Google Scholar
- (2010) Large-scale multi-period precedence constrained knapsack problem: A mining application. Electronic Notes Discrete Math. 36:407–414.Crossref, Google Scholar
- (2010) A review of operations research in mine planning. Interfaces 40(3):222–245.Link, Google Scholar
- (2008) Long-term open pit mine production planning: A review of models and algorithms. Internat. J. Mining Reclamation Environ. 22(1):3–35.Crossref, Google Scholar
- (1997) Lifting cover inequalities for the precedence-constrained knapsack problem. Discrete Appl. Math. 72(3):219–241.Crossref, Google Scholar
- (2006) Production Planning by Mixed Integer Programming (Springer Verlag, New York).Google Scholar
- (2007) The new fundamental tree algorithm for production scheduling of open pit mines. Eur. J. Oper. Res. 177(2):1153–1166.Crossref, Google Scholar
- (2011) Development of a new open pit mine phase design and production scheduling algorithm using mixed integer linear programming. Doctoral dissertation, Colorado School of Mines, Golden, CO.Google Scholar
- (1998) Integer Programming (John Wiley & Sons, New York).Google Scholar

