A mathematical programming viewpoint for solving the ultimate pit problem

DOI10.1016/S0377-2217(97)00141-0zbMATH Open0943.90077WikidataQ128017489 ScholiaQ128017489MaRDI QIDQ1296063FDOQ1296063

Robert G. Underwood, Boleslaw Tolwinski

Publication date: 10 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 758128
• An application of discrete mathematics in the design of an open pit mine
• A duality-based derivation of the maximum flow formulation of the open-pit design problem
• Publication:4887840

zbMATH Keywords

graph theorymathematical programmingmine planningnetwork programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Cites Work

• Title not available (Why is that?)
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Title not available (Why is that?)

Cited In (11)

• A real-world mine excavators timetabling methodology in open-pit mining
• An application of discrete mathematics in the design of an open pit mine
• Optimization-based heuristics for underground mine scheduling
• Optimizing the open pit-to-underground mining transition
• An integrated approach for earthwork allocation, sequencing and routing
• Title not available (Why is that?)
• Tailored Lagrangian relaxation for the open pit block sequencing problem
• MineLib: a library of open pit mining problems
• Title not available (Why is that?)
• Gallai-Ramsey numbers for fans
• A local branching heuristic for the open pit mine production scheduling problem

This page was built for publication: A mathematical programming viewpoint for solving the ultimate pit problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296063)