The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663)

From MaRDI portal
Revision as of 19:52, 10 July 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
The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
scientific article

    Statements

    The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (English)
    0 references
    22 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    min-degree constrained minimum spanning tree problem
    0 references
    branch-and-cut
    0 references
    integer programming formulations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references