VLSI Data Sets. This collection of 102 TSP instances was provided by Andre Rohe, based on VLSI data sets studied at the Forschungsinstitut für Diskrete Mathematik, Universität Bonn. The Bonn Institute is a leading academic site for applied research in VLSI design. The instances in the VLSI collection range in size from 131 cities up to 744,710 cities. In these examples, the cost of travel between cities is specified by the Eulidean distance rounded to the nearest whole number (the TSPLIB EUC_2D-norm). Like the National TSPs, this collection porivides additional tests to complement the TSPLIB set of instances. The VLSI collection is presented in a group of 11 pages, with 10 instances per page. The entire collection can also be downloaded as a single gzipped tar file vlsi_tsp.tgz.
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Kolmogorov, Vladimir: Blossom V: A new implementation of a minimum cost perfect matching algorithm (2009)
- Zachariasen, Martin; Rohe, André: Rectilinear group Steiner trees and applications in VLSI design (2003)