Gradient-constrained minimum networks. I: Fundamentals.
From MaRDI portal
Publication:5954200
DOI10.1023/A:1011903210297zbMath1068.90605WikidataQ61714640 ScholiaQ61714640MaRDI QIDQ5954200
Marcus Brazil, Joachim Hyam Rubinstein, Jia Feng Weng, Nicholas C. Wormald, Doreen Anne Thomas
Publication date: 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011903210297
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90B10: Deterministic network models in operations research
Related Items
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3}, COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ1 AND ℓ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, Gradient-constrained discounted Steiner trees. I: Optimal tree configurations, Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point, 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