An O(N log N) planar travelling salesman heuristic based on spacefilling curves (Q1166433)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An O(N log N) planar travelling salesman heuristic based on spacefilling curves
scientific article

    Statements

    An O(N log N) planar travelling salesman heuristic based on spacefilling curves (English)
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    spacefilling mapping
    0 references
    travelling salesman problem
    0 references
    heuristic
    0 references
    routing
    0 references
    implementation
    0 references
    0 references