Hop constrained Steiner trees with multiple root nodes (Q299847): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2013.11.029 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4325280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure in Approximation Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving the rooted distance-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2013.11.029 / rank
 
Normal rank

Latest revision as of 13:49, 9 December 2024

scientific article
Language Label Description Also known as
English
Hop constrained Steiner trees with multiple root nodes
scientific article

    Statements

    Hop constrained Steiner trees with multiple root nodes (English)
    0 references
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    integer programming
    0 references
    OR in telecommunications
    0 references
    Steiner tree
    0 references
    hop-constraints
    0 references

    Identifiers