An efficient method for optimizing nested open pits with operational bottom space

DOI10.1111/itor.13390MaRDI QIDQ6146633

Unnamed Author, Nelson Morales, Jorge Amaya

Publication date: 31 January 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

linear programmingopen pit mine planningultimate pit

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• MineLib: a library of open pit mining problems
• A sliding time window heuristic for open pit mine block sequencing
• A new polynomial-time algorithm for linear programming
• Partitioning procedures for solving mixed-variables programming problems
• The Benders decomposition algorithm: a literature review
• A new model for automated pushback selection
• Optimum ramp design in open pit mines
• Julia: A Fresh Approach to Numerical Computing
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• Integral Boundary Points of Convex Polyhedra
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• JuMP: A Modeling Language for Mathematical Optimization

This page was built for publication: An efficient method for optimizing nested open pits with operational bottom space