The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
scientific article

    Statements

    The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (English)
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    quadratic minimum spanning tree problem
    0 references
    Lagrangian relaxation
    0 references
    local search
    0 references

    Identifiers