Gradient-constrained minimum networks. I: Fundamentals.

DOI10.1023/A:1011903210297zbMath1068.90605DBLPjournals/jgo/BrazilRTWW01OpenAlexW1600385162WikidataQ61714640 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items (13)

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, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3} ⋮ Gradient-constrained minimum networks. III: Fixed topology ⋮ Computing Steiner points for gradient-constrained minimum networks ⋮ Minimal curvature-constrained networks ⋮ COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ₁ AND ℓ₂ METRIC SPACES ⋮ Network modelling of underground mine layout: two case studies ⋮ Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I ⋮ Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points ⋮ Cost optimisation for underground mining networks ⋮ Maximizing the net present value of a Steiner tree ⋮ Angle-restricted Steiner arborescences for flow map layout

This page was built for publication: Gradient-constrained minimum networks. I: Fundamentals.