Art
J-GLOBAL ID:200902000168431556
Reference number:92A0509047
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing.
ノードパッキングに対する強切除平面/分枝限定アルゴリズム
-
Publisher site
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=92A0509047©=1") }}
-
Access JDreamⅢ for advanced search and analysis.
{{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=92A0509047&from=J-GLOBAL&jstjournalNo=D0248A") }}
Author (2):
,
Material:
Volume:
43
Issue:
5
Page:
443-457
Publication year:
May. 1992
JST Material Number:
D0248A
ISSN:
0160-5682
Document type:
Article
Article type:
原著論文
Country of issue:
United Kingdom (GBR)
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.
,...
JST classification (1):
JST classification
Category name(code) classified by JST.
Mathematical programmings
Terms in the title (2):
Terms in the title
Keywords automatically extracted from the title.
,
Return to Previous Page