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 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
Revision as of 03:24, 28 February 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
23 September 2001
0 references
