A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4288838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for Euclidean and rectilinear Steiner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel approach to phylogenetic trees: <i>d</i>‐Dimensional geometric Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the history of the Euclidean Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic optimization: The Fermat-Weber location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search algorithms for the Euclidean Steiner tree problem in<i>n</i>dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two heuristics for the Euclidean Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner ratio conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner ratio conjecture of Gilbert and Pollak is true. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the Gilbert-Pollak conjecture on the Steiner ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a conic formulation for finding Steiner minimal trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of exact algorithms for the Euclidean Steiner tree problem in<i>n</i>-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner ratio Gilbert-Pollak conjecture is still open / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find Steiner minimal trees in Euclidean \(d\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Steiner ratio in 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Trees and 3-D Macromolecular Conformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications / rank
 
Normal rank

Revision as of 16:06, 1 August 2024

scientific article; zbMATH DE number 7709965
Language Label Description Also known as
English
A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
scientific article; zbMATH DE number 7709965

    Statements

    A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2023
    0 references
    Euclidean Steiner tree problem
    0 references
    combinatorial optimization
    0 references
    heuristic
    0 references
    second-order cone programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references