Tailored Lagrangian relaxation for the open pit block sequencing problem
From MaRDI portal
Publication:490234
DOI10.1007/S10479-012-1287-YzbMATH Open1303.90068OpenAlexW1969268769MaRDI QIDQ490234FDOQ490234
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1287-y
Recommendations
- A new algorithm for the open-pit mine production scheduling problem
- A sliding time window heuristic for open pit mine block sequencing
- Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
- Hierarchical benders decomposition for open-pit mine block sequencing
- Publication:4887840
Cites Work
- Network flows. Theory, algorithms, and applications.
- MineLib: a library of open pit mining problems
- Production Planning by Mixed Integer Programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- An application of branch and cut to open pit mine scheduling
- A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine
- Solving LP relaxations of large-scale precedence constrained problems
- A mathematical programming viewpoint for solving the ultimate pit problem
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- A new algorithm for the open-pit mine production scheduling problem
- A sliding time window heuristic for open pit mine block sequencing
- The new Fundamental Tree Algorithm for production scheduling of open pit mines
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- Large-scale multi-period precedence constrained knapsack problem: a mining application
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
Cited In (11)
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
- Solution procedures for block selection and sequencing in flat-bedded potash underground mines
- Large-scale multi-period precedence constrained knapsack problem: a mining application
- Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
- Aggregation heuristic for the open-pit block scheduling problem
- Hierarchical benders decomposition for open-pit mine block sequencing
- A new algorithm for the open-pit mine production scheduling problem
- Optimizing high-level nuclear waste disposal within a deep geologic repository
- Concurrent open-pit mine production and in-pit crushing–conveying system planning
- A local branching heuristic for the open pit mine production scheduling problem
- A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: an application to the open-pit mine block sequencing problem
Uses Software
This page was built for publication: Tailored Lagrangian relaxation for the open pit block sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490234)
