The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$ (Q6521267)

From MaRDI portal





scientific article from arXiv
Language Label Description Also known as
English
The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
scientific article from arXiv

    Statements

    The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$ (English)
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references