A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201)

From MaRDI portal
Revision as of 07:57, 3 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
A branch-and-cut algorithm for the partitioning-hub location-routing problem
scientific article

    Statements

    A branch-and-cut algorithm for the partitioning-hub location-routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 October 2010
    0 references
    size constrained clique partitioning
    0 references
    graph partitioning
    0 references
    communication networks
    0 references
    hub-location
    0 references
    branch-and-cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references