Gradient-constrained discounted Steiner trees. I: Optimal tree configurations

DOI10.1007/S10898-015-0326-ZzbMATH Open1346.90792DBLPjournals/jgo/SirinandaBGRT16OpenAlexW599644942WikidataQ61714568 ScholiaQ61714568MaRDI QIDQ280980FDOQ280980

P. A. Grossman, K. G. Sirinanda, M. Brazil, J. Hyam Rubinstein, D. A. Thomas

Publication date: 10 May 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0326-z

Recommendations

• Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
• Maximizing the net present value of a Steiner tree
• Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
• Gradient-constrained minimum networks. I: Fundamentals.
• Computing Steiner points for gradient-constrained minimum networks

zbMATH Keywords

Steiner pointsgradient constraintnet present valuenetwork optimisationoptimal mine design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• The Steiner tree problem
• Maximizing the net present value of a Steiner tree
• Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
• Network optimization for the design of underground mines
• Optimally locating a junction point for an underground mine to maximise the net present value
• Gradient-constrained minimum networks. I: Fundamentals.

Cited In (2)

• Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
• Combined optimisation of an open-pit mine outline and the transition depth to underground mining

This page was built for publication: Gradient-constrained discounted Steiner trees. I: Optimal tree configurations

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