Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing
From MaRDI portal
Publication:2830758
DOI10.1287/opre.2016.1516zbMath1348.90320OpenAlexW2463123679MaRDI QIDQ2830758
Thomas W. M. Vossen, R. Kevin Wood, Alexandra M. Newman
Publication date: 31 October 2016
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2016.1516
integer programmingproduction schedulingdeterministicsequencingheuristicBenders decompositionminingindustries
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
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, A real-world mine excavators timetabling methodology in open-pit mining, Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach, Solution procedures for block selection and sequencing in flat-bedded potash underground mines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- MineLib: a library of open pit mining problems
- Tailored Lagrangian relaxation for the open pit block sequencing problem
- A sliding time window heuristic for open pit mine block sequencing
- Implementations of special ordered sets in MP software
- The new Fundamental Tree Algorithm for production scheduling of open pit mines
- MSLiP: A computer code for the multistage stochastic linear programming problem
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Using an interior point method for the master problem in a decomposition approach
- An application of branch and cut to open pit mine scheduling
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling
- Interior point stabilization for column generation
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Optimizing Long-Term Production Plans in Underground and Open-Pit Copper Mines
- Short-term harvest planning including scheduling of harvest crews
- Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems
- Solving the Convex Cost Integer Dual Network Flow Problem
- Decomposition Principle for Linear Programs
- Solving LP Relaxations of Large-Scale Precedence Constrained Problems
- Dual nested decomposition of staircase linear programs
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- Multi-Stage Production Planning
- Nested decomposition for dynamic models
- Multicommodity Distribution System Design by Benders Decomposition
- Nested Decomposition and Multi-Stage Linear Programs
- Decomposition of arborescent linear programs
- A Computational Study of Search Strategies for Mixed Integer Programming
- A New Algorithm for the Open-Pit Mine Production Scheduling Problem
- Parallel Decomposition: Results for Staircase Linear Programs
- Dynamic Linear Programs for Production Scheduling
