A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
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: Mosek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bonmin / 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.1007/s10589-016-9835-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2284604408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / 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: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for convex mixed integer nonlinear programs / 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: The Steiner tree problem / 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: Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbital branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Steiner minimum trees: An improved exact algorithm / rank
 
Normal rank

Latest revision as of 14:30, 12 July 2024

scientific article
Language Label Description Also known as
English
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
scientific article

    Statements

    A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2016
    0 references
    Euclidean Steiner tree problem
    0 references
    mixed integer nonlinear programming
    0 references
    branch-and-bound
    0 references
    isomorphism pruning
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers