The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761)

From MaRDI portal
Revision as of 19:56, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The traveling salesman problem: An overview of exact and approximate algorithms
scientific article

    Statements

    The traveling salesman problem: An overview of exact and approximate algorithms (English)
    0 references
    0 references
    11 October 1992
    0 references
    survey
    0 references
    traveling salesman
    0 references
    complexity analysis
    0 references
    exact algorithms
    0 references
    heuristic algorithms
    0 references

    Identifiers