TSPLIB—A Traveling Salesman Problem Library

  • Gerhard Reinelt
    Institut für Mathematik, Universität, Augsburg, Universitätsstrasse 8, D-8900 Federal Republic of Germany

この論文をさがす

説明

<jats:p> 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. </jats:p><jats:p> INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499. </jats:p>

収録刊行物

  • ORSA Journal on Computing

    ORSA Journal on Computing 3 (4), 376-384, 1991-11

    Institute for Operations Research and the Management Sciences (INFORMS)

被引用文献 (35)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ