Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687)

From MaRDI portal
Revision as of 22:11, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6107798
Language Label Description Also known as
English
Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs
scientific article; zbMATH DE number 6107798

    Statements

    Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree
    0 references
    discretized reformulation
    0 references
    knapsack reformulation
    0 references
    GRASP
    0 references
    VNS
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references