Gradient-constrained minimum networks. I: Fundamentals.
From MaRDI portal
Recommendations
- Gradient-constrained minimum networks. III: Fixed topology
- Computing Steiner points for gradient-constrained minimum networks
- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
- Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space. II: The gradient-constraint \(m\) satisfies \(1 \leq m \leq \sqrt{3}\)
- scientific article; zbMATH DE number 1163706
Cited in
(14)- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
- Minimal curvature-constrained networks
- Gradient-constrained minimum networks. III: Fixed topology
- Computing Steiner points for gradient-constrained minimum networks
- Maximizing the net present value of a Steiner tree
- Angle-restricted Steiner arborescences for flow map layout
- Cost optimisation for underground mining networks
- Gradient-constrained discounted Steiner trees. I: Optimal tree configurations
- Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
- Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space. II: The gradient-constraint \(m\) satisfies \(1 \leq m \leq \sqrt{3}\)
- scientific article; zbMATH DE number 1163706 (Why is no real title available?)
- Computing Steiner points and probability Steiner points in \(\ell _{1}\) and \(\ell _{2}\) metric spaces
- Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I
- Network modelling of underground mine layout: two case studies
This page was built for publication: Gradient-constrained minimum networks. I: Fundamentals.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954200)
