Multi-depot multiple TSP: a polyhedral study and computational results (Q367624)

From MaRDI portal
Revision as of 21:41, 6 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
Multi-depot multiple TSP: a polyhedral study and computational results
scientific article

    Statements

    title
    Multi-depot multiple TSP: a polyhedral study and computational results (English)
    0 references
    author
    Mohammad Hasan
    0 references
    M. Dambrine
    0 references
    H. S. Yoon
    0 references
    publication date
    16 September 2013
    0 references
    Mathematics Subject Classification ID
    90C27
    0 references
    90C10
    0 references
    90C57
    0 references
    zbMATH DE Number
    6208483
    0 references
    zbMATH Keywords
    multiple depot traveling salesman problem
    0 references
    polyhedral study
    0 references
    Branch-and-Cut
    0 references
    describes a project that uses
    Concorde
    0 references
    TSPLIB
    0 references
    OpenAlex ID
    W2119235896
    0 references
    cites work
    Q3425132
    0 references
    Q3217886
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q367624&oldid=35352011"
    Powered by MediaWiki