A branch-and-cut algorithm for two-level survivable network design problems (Q342262)

From MaRDI portal
Revision as of 14:05, 20 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for two-level survivable network design problems
scientific article

    Statements

    A branch-and-cut algorithm for two-level survivable network design problems (English)
    0 references
    17 November 2016
    0 references

    Identifiers