Art
J-GLOBAL ID:200902143906239091   Reference number:94A0885312

The Traveling Salesman. Computational Solutions for TSP Applications.

巡回セールスマン TSPアプリケーションのための計算の複雑さ解法
Author (1):
Material:
Volume: 840  Page: 230P  Publication year: 1994 
JST Material Number: H0078D  ISSN: 0302-9743  Document type: Proceedings
Article type: 原著論文  Country of issue: Germany, Federal Republic of (DEU)  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.
,...
Semi 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.

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=94A0885312&from=J-GLOBAL&jstjournalNo=H0078D") }}
JST classification (2):
JST classification
Category name(code) classified by JST.
Theory of computation  ,  Network methods 
Terms in the title (5):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page