Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767)

From MaRDI portal
Revision as of 17:27, 15 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
Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
scientific article

    Statements

    Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    optical network design
    0 references
    regenerator placement
    0 references
    integer programming
    0 references
    branch and cut
    0 references
    facets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references