An exact algorithm for the clustered travelling salesman problem (Q505157)

From MaRDI portal
Revision as of 08:21, 13 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
An exact algorithm for the clustered travelling salesman problem
scientific article

    Statements

    title
    An exact algorithm for the clustered travelling salesman problem (English)
    0 references
    published in
    Opsearch
    0 references
    publication date
    19 January 2017
    0 references
    zbMATH DE Number
    6676252
    0 references
    zbMATH Keywords
    clustered travelling salesman problem
    0 references
    exact
    0 references
    optimal
    0 references
    lexisearch algorithm
    0 references
    bound
    0 references
    OpenAlex ID
    W1993548687
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q505157&oldid=36301438"
    Powered by MediaWiki