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

From MaRDI portal
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 02:52, 5 March 2024

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