Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (Q1302598)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
scientific article

    Statements

    Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (English)
    0 references
    0 references
    0 references
    23 September 2001
    0 references

    Identifiers