Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098)

From MaRDI portal
Revision as of 20:14, 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
Experimental analysis of heuristics for the bottleneck traveling salesman problem
scientific article

    Statements

    title
    Experimental analysis of heuristics for the bottleneck traveling salesman problem (English)
    0 references
    author
    John LaRusic
    0 references
    Abraham P. Punnen
    0 references
    Eric Aubanel
    0 references
    publication date
    4 April 2017
    0 references
    zbMATH Keywords
    traveling salesman problem
    0 references
    bottleneck TSP
    0 references
    experimental analysis
    0 references
    maximum scatter TSP
    0 references
    heuristic algorithms
    0 references
    describes a project that uses
    LKH
    0 references
    TSPLIB
    0 references
    Concorde
    0 references
    cites work
    Q4461907
    0 references
    Q3955398
    0 references
    Bottleneck extrema
    0 references
    Q4461911
    0 references
    Q4461912
    0 references
    Q4461913
    0 references
    Q4461917
    0 references
    Q5187226
    0 references
    Q4461910
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C90
    0 references
    90C59
    0 references
    90C35
    0 references
    zbMATH DE Number
    6700353
    0 references
    OpenAlex ID
    W1995945236
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q519098&oldid=38385091"
    Powered by MediaWiki