On exact solutions for the minmax regret spanning tree problem (Q337033)

From MaRDI portal
Revision as of 21:46, 12 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
On exact solutions for the minmax regret spanning tree problem
scientific article

    Statements

    On exact solutions for the minmax regret spanning tree problem (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    minimum spanning tree
    0 references
    minmax regret
    0 references
    robust optimization
    0 references
    interval uncertainty
    0 references
    branch-and-cut
    0 references
    benders decomposition
    0 references

    Identifiers