Lower and upper bounds for the degree-constrained minimum spanning tree problem (Q3593370)

From MaRDI portal
Revision as of 12:37, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Lower and upper bounds for the degree-constrained minimum spanning tree problem
scientific article

    Statements

    Lower and upper bounds for the degree-constrained minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2007
    0 references
    0 references
    Lagrangian relaxation
    0 references
    non-delayed relax-and-cut
    0 references
    Lagrangian warm start to cutting plane algorithms
    0 references
    degree constrained minimum spanning tree
    0 references
    blossom inequalities
    0 references
    0 references
    0 references
    0 references
    0 references