Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
TSPLIB—A Traveling Salesman Problem Library
2.528
Zitationen
1
Autoren
1991
Jahr
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.
Ähnliche Arbeiten
Genetic algorithms in search, optimization, and machine learning
1989 · 49.280 Zit.
Particle swarm optimization
2002 · 46.640 Zit.
A fast and elitist multiobjective genetic algorithm: NSGA-II
2002 · 46.353 Zit.
Lecture Notes in Computer Science 1205
1999 · 38.695 Zit.
Statistical Learning Theory
1999 · 26.914 Zit.