Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
From MaRDI portal
(Redirected from Publication:280981)
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 discounted Steiner trees. I: Optimal tree configurations
- Gradient-constrained minimum networks. I: Fundamentals.
- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
- 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
Cited in
(6)- 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
- Maximizing the net present value of a Steiner tree
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)