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

From MaRDI portal
Revision as of 11:00, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    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