A branch and cut algorithm for hub location problems with single assignment (Q1771311)

From MaRDI portal
Revision as of 05:36, 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 hub location problems with single assignment
scientific article

    Statements

    title
    A branch and cut algorithm for hub location problems with single assignment (English)
    0 references
    author
    Martine Labbé
    0 references
    Hande Yaman
    0 references
    Eric Gourdin
    0 references
    publication date
    19 April 2005
    0 references
    zbMATH DE Number
    2159481
    0 references
    zbMATH Keywords
    Hub location
    0 references
    Polyhedral analysis
    0 references
    Branch and cut
    0 references
    describes a project that uses
    ABACUS
    0 references
    OR-Library
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1771311&oldid=26472975"
    Powered by MediaWiki