Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5294063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265265 / rank
 
Normal rank

Latest revision as of 09:50, 27 June 2024

scientific article
Language Label Description Also known as
English
Modeling and solving the rooted distance-constrained minimum spanning tree problem
scientific article

    Statements

    Modeling and solving the rooted distance-constrained minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    Distance-constrained spanning trees
    0 references
    model reformulation
    0 references
    Lagrangian relaxation
    0 references
    column generation
    0 references
    constrained shortest path problem
    0 references

    Identifiers