Metrics
141,318 Downloads
Contact Share
Featured Dataverses

In order to use this feature you must have at least one published or linked dataverse.

Publish Dataverse

Are you sure you want to publish your dataverse? Once you do so it must remain published.

Publish Dataverse

This dataverse cannot be published because the dataverse it is in has not been published.

Delete Dataverse

Are you sure you want to delete your dataverse? You cannot undelete this dataverse.

Advanced Search

591 to 600 of 613 Results
thz.tex
Jun 24, 2024 - TeX source code of the dissertation "Kondo Collapse and Revival by Pulsed Light"
LaTeX - 57.6 KB - MD5: cf44ff17954f674a91cadb78bff39ab9
time-stepping.tikz
Jun 24, 2024 - TeX source code of the dissertation "Kondo Collapse and Revival by Pulsed Light"
Unknown - 1.7 KB - MD5: f6b0db2b6f94ae8ceba9b83750fb2f30
velicky-contour.tikz
Jun 24, 2024 - TeX source code of the dissertation "Kondo Collapse and Revival by Pulsed Light"
Unknown - 1.3 KB - MD5: 811a3f79c71f7dfc23b9c910fdb833a5
vide.tex
Jun 24, 2024 - TeX source code of the dissertation "Kondo Collapse and Revival by Pulsed Light"
LaTeX - 22.9 KB - MD5: 8ab0ce68ca4e226a48890d7d2ebcfdfd
wetli-time-reflectivity.pdf
Jun 24, 2024 - TeX source code of the dissertation "Kondo Collapse and Revival by Pulsed Light"
Adobe PDF - 572.1 KB - MD5: c4dd17002d0a3a8e73e2c9bdfcfafeb0
wigner-rot.tikz
Jun 24, 2024 - TeX source code of the dissertation "Kondo Collapse and Revival by Pulsed Light"
Unknown - 2.1 KB - MD5: c7f19dee2bcd74f674ace65b6a1f0a05
Hard to Solve Instances of the Euclidean Traveling Salesman Problem
Hard to Solve Instances of the Euclidean Traveling Salesman Problem
May 24, 2024 - Bonn Mathematics
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/3. These instances turn out to be very hard to solve with exact TSP s...
TSPLIB_logfiles.zip
May 24, 2024 - Hard to Solve Instances of the Euclidean Traveling Salesman Problem
ZIP Archive - 32.0 MB - MD5: 6a0a7cec5b11f92d8d55f1d3b0e0b38b
log files of all Concorde runs on the TSPLIB instances as described in our paper.
Tnm.cpp
May 24, 2024 - Hard to Solve Instances of the Euclidean Traveling Salesman Problem
Plain Text - 2.7 KB - MD5: 7b508033774a937159bf8c85eae0d73e
A C++-program to generate the Tnm-instances.
Tnm_instances.zip
May 24, 2024 - Hard to Solve Instances of the Euclidean Traveling Salesman Problem
ZIP Archive - 49.7 KB - MD5: 943f09dd8af1f1fdef657f3fd908b75f
All Tnm-instances with 52 to 199 vertices.
Add Data

Log in to create a dataverse or add a dataset.

Log In
Share Dataverse

Share this dataverse on your favorite social media networks.

Link Dataverse
Reset Modifications

Are you sure you want to reset the selected metadata fields? If you do this, any customizations (hidden, required, optional) you have done will no longer appear.