Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064)

From MaRDI portal
Revision as of 20:30, 10 July 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
Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
scientific article

    Statements

    Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    nonconvex optimization
    0 references
    branch-and-price-and-cut
    0 references
    network optimization
    0 references
    reliability
    0 references