An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2007.08.006 / rank
Normal rank
 
Property / author
 
Property / author: Márcia H. C. Fampa / rank
Normal rank
 
Property / author
 
Property / author: Márcia H. C. Fampa / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mosek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FindSteinerTree / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2007.08.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989550031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact computation of Steiner minimal trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved computation of plane Steiner minimal trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions / 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: 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: 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: Hexagonal coordinate systems and Steiner minimal trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / 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: How to find Steiner minimal trees in Euclidean \(d\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in the euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Steiner minimum trees: An improved exact algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2007.08.006 / rank
 
Normal rank

Latest revision as of 09:37, 10 December 2024

scientific article
Language Label Description Also known as
English
An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
scientific article

    Statements

    An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (English)
    0 references
    0 references
    0 references
    29 October 2008
    0 references
    Euclidean Steiner problem
    0 references
    strong branching
    0 references
    0 references
    0 references
    0 references

    Identifiers