Back to dataset: Hard to Solve Instances of the Euclidean Traveling Salesman Problem

Tnm_instances.zip

Important usage condition: Use and redistribution are governed by CC BY 4.0. Review and comply with the license before using the data.

Dataset: Hard to Solve Instances of the Euclidean Traveling Salesman Problem
Published version: 1.0
Media type: application/zip
Size: 50926 bytes
Checksum: MD5 943f09dd8af1f1fdef657f3fd908b75f
License: CC BY 4.0

All Tnm-instances with 52 to 199 vertices.

Before downloading: Use and redistribution are governed by CC BY 4.0. Review and comply with the license before using the data.

Download Tnm_instances.zip

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.