A mathematical programming viewpoint for solving the ultimate pit problem

DOI10.1016/S0377-2217(97)00141-0zbMath0943.90077WikidataQ128017489 ScholiaQ128017489MaRDI QIDQ1296063

Boleslaw Tolwinski, Robert G. Underwood

Publication date: 10 September 2000

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

zbMATH Keywords

network programminggraph theorymathematical programmingmine planning

Mathematics Subject Classification ID

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

Related Items

An integrated approach for earthwork allocation, sequencing and routing, Optimization-based heuristics for underground mine scheduling, MineLib: a library of open pit mining problems, A real-world mine excavators timetabling methodology in open-pit mining, Tailored Lagrangian relaxation for the open pit block sequencing problem, A local branching heuristic for the open pit mine production scheduling problem, Optimizing the open pit-to-underground mining transition

Cites Work

• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Unnamed Item
• Unnamed Item