Back to dataset: Hard to Solve Instances of the Euclidean Traveling Salesman Problem
TSPLIB_logfiles.zip
- Dataset
- Hard to Solve Instances of the Euclidean Traveling Salesman Problem
- Published version
- 1.0
- Media type
- application/zip
- Size
- 33528446 bytes
- Checksum
- MD5 6a0a7cec5b11f92d8d55f1d3b0e0b38b
- License
- CC BY 4.0
log files of all Concorde runs on the TSPLIB instances as described in our paper.
Expected crawler behaviour
Use a stable, truthful User-Agent with product/version and a working contact URL. Across all IP addresses and HTTP connections used by one crawler identity, allow no more than 5 requests in flight and wait at least 20 seconds between request starts. Crawl URLs listed in the catalog sitemap, including file pages and download URLs when they are published, use conditional requests, honor Retry-After, and apply exponential backoff after errors.
The welcome page may link to the interactive repository for human navigation. Automated clients must not treat that human link as a catalog crawl target.
Read the live machine-readable crawler policy before and during a crawl. Stop crawling when it reports CPU or memory utilization at or above 80% and 80% respectively.