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

DOI10.1137/S1052623494275069zbMath0890.90173OpenAlexW2053792000MaRDI QIDQ4377584

Fabrice Janez, François Chapeau-Blondeau, 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

optimizationSteiner problemrelaxationminimum spanning treeminimal tree

Mathematics Subject Classification ID

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

Related Items (4)

A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) ⋮ Local search for the Steiner tree problem in the Euclidean plane ⋮ Reorganizing topologies of Steiner trees to accelerate their eliminations ⋮ Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions

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