61 to 70 of 144 Results
Plain Text - 3.2 KB -
MD5: d534941590fdb554ee6df4cf1e5836ee
|
Plain Text - 4.6 KB -
MD5: 157ffa5ebc92d033870ac456c1c65bc1
|
Plain Text - 2.5 KB -
MD5: 0637d180a2ddd05ef2268f606ad50734
|
Plain Text - 4.1 KB -
MD5: 260a629805e4e23e79aac915087a47f8
|
Plain Text - 5.3 KB -
MD5: 66c6d5d0338fc06da15ec0576a96937a
|
Plain Text - 12.8 KB -
MD5: c60fe00f718b704f2be4aa716bdc0063
|
Plain Text - 7.3 KB -
MD5: 030b63cefd38f699ad9c323883145556
ReadMe_Ag2CdSnS4 |
Dec 13, 2025 -
Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver
Plain Text - 19.0 KB -
MD5: 59148db7535d8981e8ba37537feab89b
Approximate route for L1-metric obtained by the LK algorithm. Intended for comparison with the exact solution. |
Dec 13, 2025 -
Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver
Plain Text - 19.0 KB -
MD5: 2aabdfae9d18760417a354f999b50e7d
The result of the heuristic solution of the problem for the L2 metric using the Lin-Kernighan (LK) algorithm. The route representation format is the same as in the optimal tour file. |
Dec 13, 2025 -
Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver
Plain Text - 19.0 KB -
MD5: 1efb16de1a0d84affc8f493b9d7afda8
Text file with the optimal route found by Concorde for the L1 metric. Represents the optimal tour obtained by the exact solution algorithm. |