Art

J-GLOBAL ID：202002246216369845   Reference number：20A0527648

An approximation algorithm for the partial covering 0-1 integer program

部分被覆0-1整数計画のための近似アルゴリズム【JST・京大機械翻訳】

Author (3)： Takazawa Yotaro (Department of Industrial Engineering and Management, Tokyo Institute of Technology, 2-12-1 Ohokayama, Meguro-ku Tokyo, 152-8552, Japan) ,  Mizuno Shinji (Department of Industrial Engineering and Economics, Tokyo Institute of Technology, Japan) ,  Kitahara Tomonari (Department of Industrial Engineering and Economics, Tokyo Institute of Technology, Japan)
Material： Discrete Applied Mathematics  (Discret Appl Math)
Volume： 275  Page： 126-133  Publication year： 2020 
JST Material Number： A1227A  ISSN： 0166-218X  Document type： Article
Article type： 原著論文  Country of issue： Netherlands (NLD)  Language： ENGLISH (EN)

Abstract/Point： The partial covering 0-1 integ...

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

Thesaurus term： *integer programming ,  multiplex ,  covering problem ,  *covering ,  relaxation phenomenon ,  *approximate algorithm

Author keywords (3)： Approximation algorithms ,  Partial covering 0-1 integer program ,  Primal-dual method

JST classification (5)： Basics of graph theory  (IA02020S) ,  Theory of computation  (JB02000A) ,  Structure and chemistry of genes  (EC02020U) ,  Network methods  (KA03040X) ,  Process control  (KB03030P)

Terms in the title (2)： 整数計画 ,  近似アルゴリズム