Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
From MaRDI portal
Publication:280981
DOI10.1007/S10898-015-0325-0zbMATH Open1336.90099OpenAlexW791344691WikidataQ61714569 ScholiaQ61714569MaRDI QIDQ280981FDOQ280981
Authors: K. G. Sirinanda, P. A. Grossman, 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-0325-0
Recommendations
- Gradient-constrained discounted Steiner trees. I: Optimal tree configurations
- Maximizing the net present value of a Steiner tree
- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
- Computing Steiner points for gradient-constrained minimum networks
- Gradient-constrained minimum networks. I: Fundamentals.
Cites Work
- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
- Maximizing the net present value of a Steiner tree
- Gradient-constrained discounted Steiner trees. I: Optimal tree configurations
- 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 (5)
- An exact algorithm for the Euclidean \(k\)-Steiner tree problem
- Gradient-constrained discounted Steiner trees. I: Optimal tree configurations
- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
- Computing Steiner points for gradient-constrained minimum networks
- Cost optimisation for underground mining networks
This page was built for publication: Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280981)
