A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem

DOI10.1137/S1052623494275069MaRDI QIDQ4377584zbMATH OpenOpenAlexFDO

Authors François Chapeau-Blondeau, Fabrice Janez, Jean-Louis Ferrier

Publication date 10 February 1998

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623494275069

zbMATH Keywords

minimal treeminimum spanning treeoptimizationrelaxationSteiner problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to calculus of variations and optimal control (49-04) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Two heuristics for the Euclidean Steiner tree problem
• New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\)
• scientific article; zbMATH DE number 1439863
• Improved computation of plane Steiner minimal trees
• An algorithm for the steiner problem in the euclidean plane

Cited in

(8)

• A neural network for the Steiner minimal tree problem
• Local search for the Steiner tree problem in the Euclidean plane
• Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions
• Global optimization of network length and simulation of film evolution
• scientific article; zbMATH DE number 1439863 (Why is no real title available?)
• Reorganizing topologies of Steiner trees to accelerate their eliminations
• A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
• A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space

This page was built for publication: A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377584)