journal article Nov 01, 1991

TSPLIB—A Traveling Salesman Problem Library

View at Publisher Save 10.1287/ijoc.3.4.376
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.
Topics

No keywords indexed for this article. Browse by subject →

Cited By
1,958
International Journal of Computatio...
IEEE Transactions on Evolutionary C...
Arabian Journal for Science and Eng...
A multioperator genetic algorithm for the traveling salesman problem with job-times

Pablo Gutiérrez-Aguirre, Carlos Contreras-Bolton · 2024

Expert Systems with Applications
European Journal of Operational Res...
European Journal of Operational Res...
Pattern Recognition
IEEE Transactions on Neural Network...
IEEE Transactions on Neural Network...
Arabian Journal for Science and Eng...
Expert Systems with Applications
SN Computer Science
IEEE Transactions on Industrial Inf...
Mathematics of Operations Research
Metrics
1,958
Citations
0
References
Details
Published
Nov 01, 1991
Vol/Issue
3(4)
Pages
376-384
Cite This Article
Gerhard Reinelt (1991). TSPLIB—A Traveling Salesman Problem Library. INFORMS Journal on Computing, 3(4), 376-384. https://doi.org/10.1287/ijoc.3.4.376
Related

You May Also Like

Tabu Search—Part I

Fred Glover · 1989

4,909 citations

A Computational Study of the Job-Shop Scheduling Problem

David Applegate, William Cook · 1991

636 citations