GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743)

From MaRDI portal
Revision as of 14:47, 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
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
scientific article

    Statements

    title
    GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (English)
    0 references
    author
    Mário Mestria
    0 references
    Simone de Lima Martins
    0 references
    Luiz Satoru Ochi
    0 references
    publication date
    10 November 2016
    0 references
    zbMATH Keywords
    combinatorial optimization
    0 references
    clustered traveling salesman problem
    0 references
    heuristics
    0 references
    path relinking
    0 references
    GRASP
    0 references
    describes a project that uses
    PERL
    0 references
    TTTPLOTS
    0 references
    CPLEX
    0 references
    TSPLIB
    0 references
    GRASP
    0 references
    Concorde
    0 references
    cites work
    Q4377051
    0 references
    Q4350079
    0 references
    Q4452897
    0 references
    Q4365133
    0 references
    Q4461911
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90-04
    0 references
    90C35
    0 references
    90C59
    0 references
    zbMATH DE Number
    6650554
    0 references
    OpenAlex ID
    W2031673408
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q336743&oldid=38310712"
    Powered by MediaWiki