Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points

DOI10.1007/s10898-007-9201-xzbMath1168.90626OpenAlexW2056957755WikidataQ61714624 ScholiaQ61714624MaRDI QIDQ1024825

Marcus Brazil, Jia Feng Weng, Doreen Anne Thomas

Publication date: 17 June 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9201-x

zbMATH Keywords

Steiner treeslocally minimalgradient constrainedminimum networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)

Related Items (6)

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 ⋮ Network modelling of underground mine layout: two case studies ⋮ Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I

Cites Work

• Unnamed Item
• Unnamed Item
• A variational approach to the Steiner network problem
• Minimum networks for four points in space
• Exactly solvable and unsolvable shortest network problems in 3D-space
• Network optimization for the design of underground mines
• Gradient-constrained minimum networks. I: Fundamentals.

This page was built for publication: Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points