About J-GLOBAL

日本語

Font size
  • A
  • A

Articleの詳細情報

ArticleJ-GLOBAL ID:200902015683891346整理番号:93A0181940

A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem.

0/1ナップサック問題に対する0.5‐限定どん欲アルゴリズムに関する覚え書き

著者:MARTELLO S(Univ. Torino, ITA)、TOTH P(Univ. Bologna, ITA)
資料名:Inf Process Lett 巻:44 号:4 ページ:221-222
発行年:1992年12月10日
  • J-GLOBAL home
  • Bookmark J-GLOBAL

J-GLOBAL: Linking, Expanding and Sparking

About J-GLOBAL

Linking

J-GLOBAL links information that represents the key to research and development. For example, linking articles and patents with people (authors and inventors) enables the extraction of a sequence of information.
It’s useful for making new discoveries and uncovering new information.

Expanding

The system enables searches of similar kinds of content through linkage with external sites.
It helps you to obtain knowledge from dissimilar fields and discover concepts that cross the boundaries of specialisms.

Sparking

Through repeated linkage and expansioniteration, J-GLOBAL provides unexpected hints for problem-solving and the illumination of new ideas.