XCSP 2.1 Benchmarks

---

travellingSalesman-25

Lecoutre's category
PATT (Patterned Instances) - Travelling Salesman P
Lecoutre's tooltips
The Travelling Salesperson problem is the task, given a set of cities, of finding a tour of minimal length that traverses each city (only once). Two series of 15 ternary instances (all sat) have been generated by Radoslaw Szymanek for the 2005 competition.
Source
http://www.cril.univ-artois.fr/~lecoutre/research/benchmarks/travellingSalesman-25.tgz
Comments
None

Number of instances: 15 (15 processed, 0 partially processed, 0 failed)

Processing completed
normalized-tsp-25-13-ext
normalized-tsp-25-163-ext
normalized-tsp-25-190-ext
normalized-tsp-25-3-ext
normalized-tsp-25-312-ext
normalized-tsp-25-38-ext
normalized-tsp-25-456-ext
normalized-tsp-25-48-ext
normalized-tsp-25-523-ext
normalized-tsp-25-54-ext
normalized-tsp-25-561-ext
normalized-tsp-25-66-ext
normalized-tsp-25-681-ext
normalized-tsp-25-715-ext
normalized-tsp-25-843-ext

Partially processed

Processing failed