461 to 470 of 835 Results
Jun 4, 2024 -
Episodic ABF analysis
Markdown Text - 1.8 KB -
MD5: 872e304975be0cb1a59846e84d0d46eb
|
Jun 4, 2024 -
Episodic ABF analysis
MATLAB Source Code - 56.6 KB -
MD5: 5a3fb8fe675fb66ed8f0b655395c065c
|
Jun 4, 2024 -
Episodic ABF analysis
Plain Text - 1.3 KB -
MD5: 9bef665dd1f26f9d528959d20a0bdc68
|
Hougardy, Stefan, 2024, "Hard to Solve Instances of the Euclidean Traveling Salesman Problem", https://doi.org/10.60507/FK2/ESZ1QZ, bonndata, V1
In our paper Hard to Solve Instances of the Euclidean Traveling Salesman Problem (Mathematical Programming Computation (2021) 13:51-74) we construct a family of Euclidean instances for the Traveling Salesman Problem for which the integrality ratio of the subtour LP converges to 4... |
ZIP Archive - 32.0 MB -
MD5: 6a0a7cec5b11f92d8d55f1d3b0e0b38b
log files of all Concorde runs on the TSPLIB instances as described in our paper. |
Plain Text - 2.7 KB -
MD5: 7b508033774a937159bf8c85eae0d73e
A C++-program to generate the Tnm-instances. |
ZIP Archive - 49.7 KB -
MD5: 943f09dd8af1f1fdef657f3fd908b75f
All Tnm-instances with 52 to 199 vertices. |
ZIP Archive - 174.9 MB -
MD5: 039307e746f02f7901bd49be087af1a2
|
Plain Text - 1.4 KB -
MD5: 3dc19eb685e8320cb971646a564b93b3
|
Hougardy, Stefan, 2024, "Triangular Grid Instances for the Euclidean Steiner Tree Problem", https://doi.org/10.60507/FK2/XLGFI4, bonndata, V1
This data set contains triangular nxk arrays with 2<=n, k<=10 using the TSPLIB-format. The instances where generated as part of the master's thesis of Daphne Rohrssen written 2022 under the supervision of Stefan Hougardy at the University of Bonn. Some of these instances are very... |
