Art
J-GLOBAL ID：200902131011524981   Reference number：96A0130174

Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale, Asymmetric Traveling Salesman Problems.

アルゴリズム750 CDT 大規模非対称巡回セールスマン問題の厳密解を与えるサブルーチン
Author (3)：
CARPANETO G

About CARPANETO G

(Univ. Modena)

About Univ. Modena

, 
DELL'AMICO M

About DELL'AMICO M

(Politecnico di Milano)

About Politecnico di Milano

, 
TOTH P

About TOTH P

(Univ. Bologna)

About Univ. Bologna


Material：
ACM Transactions on Mathematical Software  (ACM Transactions on Mathematical Software (Association for Computing Machinery))

About ACM Transactions on Mathematical Software


Volume： 21  Issue： 4  Page： 410-415  Publication year： Dec. 1995 
JST Material Number： D0669A  ISSN： 0098-3500  Document type： Article
Article type： 原著論文  Country of issue： United States (USA)  Language： ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
traveling salesman problem

About traveling salesman problem

,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=96A0130174&from=J-GLOBAL&jstjournalNo=D0669A") }}
JST classification (2)：
JST classification
Category name(code) classified by JST.
Numerical computation 
(JE02000J)

About Numerical computation

,  Network methods 
(KA03040X)

About Network methods

Terms in the title (7)：
Terms in the title
Keywords automatically extracted from the title.
アルゴリズム

About アルゴリズム

, 
CDT

About CDT

, 
大規模

About 大規模

, 
非対称

About 非対称

, 
巡回セールスマン問題

About 巡回セールスマン問題

, 
厳密解

About 厳密解

, 
サブルーチン

About サブルーチン


Return to Previous Page

TOP

BOTTOM