Local search for the Steiner tree problem in the Euclidean plane (Q1806730): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FindSteinerTree / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LEDA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / 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 delaunay triangulation‐based heuristic for the euclidean steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generation of Minimal Trees with a Steiner Topology / 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: Steiner Trees for Ladders / 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 better heuristics for Steiner minimum trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for full Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest network under a given topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neural network for the Steiner minimal tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3889078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Scheme for Finding Steiner Trees with Obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of a partitioning algorithm for the steiner tree problem in <i>R</i><sup>2</sup> and <i>R</i><sup>3</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup> / 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: Q3028682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs: Heuristic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner minimal trees for three points with one convex polygonal obstacle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenation-based greedy heuristics for the Euclidean Steiner tree problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:00, 29 May 2024

scientific article
Language Label Description Also known as
English
Local search for the Steiner tree problem in the Euclidean plane
scientific article

    Statements

    Local search for the Steiner tree problem in the Euclidean plane (English)
    0 references
    0 references
    8 November 1999
    0 references
    0 references
    heuristics
    0 references
    Steiner tree
    0 references
    local search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references