Network modelling of underground mine layout: two case studies

DOI10.1111/J.1475-3995.2007.00579.XzbMath1156.90476OpenAlexW2094311069MaRDI QIDQ5438555

David H. Lee, Marcus Brazil, Nicholas C. Wormald, Doreen Anne Thomas

Publication date: 24 January 2008

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

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2007.00579.x

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)

Related Items (2)

Gradient-constrained minimum networks. III: Fixed topology ⋮ Network optimization for the design of underground mines

Cites Work

• Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
• How to find Steiner minimal trees in Euclidean \(d\)-space
• The Steiner tree problem
• Cost optimisation for underground mining networks
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• Network optimization for the design of underground mines
• Gradient-constrained minimum networks. I: Fundamentals.

This page was built for publication: Network modelling of underground mine layout: two case studies