TSPLIB—A Traveling Salesman Problem Library
ORSA Journal on Computing · 1991 · Volume 3 · Issue 4
Abstract
This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties. For every problem a short description is given along with known lower and upper bounds. Several references to computational tests on some of the problems are given. INFORMS Journal on Computing , ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Keywords
networks/graphs: traveling salesman, a data base of test problems instances, traveling salesman problem, a data base of test problem instances
Enable JavaScript for citation tools and additional paper interactions.