Network optimization for the design of underground mines
From MaRDI portal
Publication:3418121
DOI10.1002/net.20140zbMath1131.90410OpenAlexW4229943770WikidataQ61714626 ScholiaQ61714626MaRDI QIDQ3418121
Marcus Brazil, Doreen Anne Thomas
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20140
Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)
Related Items (11)
Gradient-constrained discounted Steiner trees. I: Optimal tree configurations ⋮ Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point ⋮ Computing Steiner points for gradient-constrained minimum networks ⋮ Optimizing the open pit-to-underground mining transition ⋮ Network modelling of underground mine layout: two case studies ⋮ Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I ⋮ A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine ⋮ Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points ⋮ Maximizing the net present value of a Steiner tree ⋮ Optimal curvature and gradient-constrained directional cost paths in 3-space ⋮ Angle-restricted Steiner arborescences for flow map layout
Cites Work
This page was built for publication: Network optimization for the design of underground mines