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

DOI10.1007/s10898-015-0326-zzbMath1346.90792OpenAlexW599644942WikidataQ61714568 ScholiaQ61714568MaRDI QIDQ280980

P. A. Grossman, K. G. Sirinanda, Marcus Brazil, Joachim Hyam Rubinstein, Doreen Anne 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

zbMATH Keywords

Steiner pointsnet present valuenetwork optimisationgradient constraintoptimal mine design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (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

Cites Work

• Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
• The Steiner tree problem
• Maximizing the net present value of a Steiner tree
• 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.

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