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

From MaRDI portal
Revision as of 00:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the hub location and routing problem
scientific article

    Statements

    title
    A branch-and-cut algorithm for the hub location and routing problem (English)
    0 references
    publication date
    10 November 2016
    0 references
    zbMATH Keywords
    hub location
    0 references
    routing
    0 references
    valid inequalities
    0 references
    branch-and-cut
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B80
    0 references
    90B06
    0 references
    90C57
    0 references
    zbMATH DE Number
    6650693
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q337094&oldid=25525590"
    Powered by MediaWiki