Art

J-GLOBAL ID：201902272630879378   Reference number：19A2879892

An Efficient Branch-and-Cut Algorithm for Approximately Submodular Function Maximization

近似サブモジュラ関数最大化のための効率的な分枝切断アルゴリズム【JST・京大機械翻訳】

Author (3)： Uematsu Naoya (Osaka University,Center for Advanced Intelligence Project (AIP), RIKEN, and Graduate School of Information Science and Technology) ,  Umetani Shunji (Osaka University, and Center for Advanced Intelligence Project (AIP), RIKEN,Graduate School of Information Science and Technology) ,  Kawahara Yoshinobu (Institute of Mathematics for Industry (IMI), Kyushu University, and Center for Advanced Intelligence Project (AIP), RIKEN)
Material： IEEE Conference Proceedings  (IEEE Conf Proc)
Volume： 2019  Issue： SMC  Page： 3160-3167  Publication year： 2019 
JST Material Number： W2441A  Document type： Proceedings
Article type： 原著論文  Country of issue： United States (USA)  Language： ENGLISH (EN)

Abstract/Point： When approaching problems in c...

Register(free) or Log In to access     To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=19A2879892&from=J-GLOBAL&jstjournalNo=W2441A") }}

Thesaurus term： benchmark ,  formulation ,  branch and bound method ,  *algorithm ,  utility function ,  subset ,  computer science ,  integer programming ,  *approximation method ,  exponential function ,  search tree ,  optimal solution

JST classification (1)： Graphic and image processing in general  (JE04010I)

Terms in the title (6)： 近似 ,  サブ ,  関数 ,  最大化 ,  分枝 ,  アルゴリズム