Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552)

From MaRDI portal
Revision as of 12:02, 24 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
Upper and lower bounding strategies for the generalized minimum spanning tree problem
scientific article

    Statements

    Upper and lower bounding strategies for the generalized minimum spanning tree problem (English)
    0 references
    0 references
    16 March 2006
    0 references
    0 references
    generalized minimum spanning tree
    0 references
    Steiner tree
    0 references
    randomized greedy heuristic
    0 references
    genetic algorithm
    0 references
    Lagrangian relaxation
    0 references
    0 references