Tailored Lagrangian Relaxation for the open pit block sequencing problem
- 16 January 2013
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 222 (1) , 419-438
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- MineLib: a library of open pit mining problemsAnnals of Operations Research, 2012
- A New Algorithm for the Open-Pit Mine Production Scheduling ProblemOperations Research, 2012
- A sliding time window heuristic for open pit mine block sequencingOptimization Letters, 2011
- A strengthened formulation and cutting planes for the open pit mine production scheduling problemComputers & Operations Research, 2010
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problemsAnnals of Operations Research, 2010
- Solving LP Relaxations of Large-Scale Precedence Constrained ProblemsLecture Notes in Computer Science, 2010
- Large-scale open pit production scheduling using Mixed Integer Linear ProgrammingInternational Journal of Mining and Mineral Engineering, 2010
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivityComputers & Operations Research, 2009
- An Application of Branch and Cut to Open Pit Mine SchedulingJournal of Global Optimization, 2003
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 1994