A Method for Solving Traveling-Salesman Problems

DOI Web Site 被引用文献21件
  • G. A. Croes
    Exploration and Production Research Division, Shell Development Company, Houston, Texas

書誌事項

公開日
1958-12
DOI
  • 10.1287/opre.6.6.791
公開者
Institute for Operations Research and the Management Sciences (INFORMS)

この論文をさがす

説明

<jats:p> The traveling-salesman problem is a generalized form of the simple problem to find the smallest closed loop that connects a number of points in a plane. Efforts in the past to find an efficient method for solving it have met with only partial success. The present paper describes a method of solution that has the following properties (a) It is applicable to both symmetric and asymmetric problems with random elements (b) It does not use subjective decisions, so that it can be completely mechanized (c) It is appreciably faster than any other method proposed (d) It can be terminated at any point where the solution obtained so far is deemed sufficiently accurate. </jats:p>

収録刊行物

  • Operations Research

    Operations Research 6 (6), 791-812, 1958-12

    Institute for Operations Research and the Management Sciences (INFORMS)

被引用文献 (21)*注記

もっと見る

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

問題の指摘

ページトップへ