Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297)

From MaRDI portal
Revision as of 18:50, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
scientific article

    Statements

    Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (English)
    0 references
    9 September 2019
    0 references
    combinatorial optimization
    0 references
    spanning trees
    0 references
    Lagrangian relaxation
    0 references
    semidefinite programming
    0 references
    semi-infinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers