New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem (Q4268854)

From MaRDI portal
Revision as of 10:54, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1354494
Language Label Description Also known as
English
New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem
scientific article; zbMATH DE number 1354494

    Statements

    New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem (English)
    0 references
    0 references
    0 references
    0 references
    28 October 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    analysis of algorithms
    0 references
    explicit machine computation and programs (in optimization heading)
    0 references
    explicit machine computation and programs (in computer science heading)
    0 references
    0 references