Computing compatible tours for the symmetric traveling salesman problem (Q542055)

From MaRDI portal
Revision as of 20:58, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing compatible tours for the symmetric traveling salesman problem
scientific article

    Statements

    title
    Computing compatible tours for the symmetric traveling salesman problem (English)
    0 references
    author
    Matteo Fortini
    0 references
    Adam N. Letchford
    0 references
    Andrea Lodi
    0 references
    Klaus M. Wenger
    0 references
    publication date
    8 June 2011
    0 references
    zbMATH Keywords
    traveling salesman problem
    0 references
    heuristics
    0 references
    branch-and-cut
    0 references
    describes a project that uses
    Concorde
    0 references
    TSPLIB
    0 references
    LKH
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C57
    0 references
    90C59
    0 references
    zbMATH DE Number
    5905303
    0 references
    Wikidata QID
    Q57702184
    0 references
    OpenAlex ID
    W2102792606
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q542055&oldid=38395474"
    Powered by MediaWiki