Art
J-GLOBAL ID:200902031067140405   Reference number:89A0259686

A probabilistic heuristic for a computationally difficult set covering problem.

計算上困難な集合被覆問題の確率的ヒューリスティック法
Author (2):
Material:
Volume:Issue:Page: 67-71  Publication year: Apr. 1989 
JST Material Number: H0832A  ISSN: 0167-6377  CODEN: ORLED5  Document type: Article
Article type: 短報  Country of issue: Netherlands (NLD)  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=89A0259686&from=J-GLOBAL&jstjournalNo=H0832A") }}
JST classification (2):
JST classification
Category name(code) classified by JST.
Mathematical programmings  ,  Theory of computation 
Terms in the title (5):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page