Quasiabelian landscapes of the traveling salesman problem are elementary (Q834186)

From MaRDI portal
Revision as of 22:02, 1 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
Quasiabelian landscapes of the traveling salesman problem are elementary
scientific article

    Statements

    Quasiabelian landscapes of the traveling salesman problem are elementary (English)
    0 references
    0 references
    0 references
    19 August 2009
    0 references
    0 references
    traveling salesman problem
    0 references
    TSP
    0 references
    permutation
    0 references
    group representation
    0 references
    landscape
    0 references
    elementary
    0 references
    eigenvector
    0 references
    eigenvalue
    0 references
    quasiabelian
    0 references
    0 references