The traveling salesman problem. Approximate algorithms (Q917453)

From MaRDI portal
Revision as of 18:11, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)





scientific article
Language Label Description Also known as
English
The traveling salesman problem. Approximate algorithms
scientific article

    Statements

    The traveling salesman problem. Approximate algorithms (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    efficiency of heuristic algorithms
    0 references
    traveling salesman
    0 references
    worst-case behavior
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references