Art

J-GLOBAL ID：201902240345127272   Reference number：19A2521565

Approximation algorithms for the covering-type k-violation linear program

被覆型k-破れ線形プログラムのための近似アルゴリズム【JST・京大機械翻訳】

Author (3)： Takazawa Yotaro (Department of Industrial Engineering and Economics, Tokyo Institute of Technology, Tokyo, Japan) ,  Mizuno Shinji (Department of Industrial Engineering and Economics, Tokyo Institute of Technology, Tokyo, Japan) ,  Kitahara Tomonari (Department of Industrial Engineering and Economics, Tokyo Institute of Technology, Tokyo, Japan)
Material： Optimization Letters
Volume： 13  Issue： 7  Page： 1515-1521  Publication year： 2019 
JST Material Number： W4817A  ISSN： 1862-4472  Document type： Article
Article type： 原著論文  Country of issue： Germany, Federal Republic of (DEU)  Language： ENGLISH (EN)

Abstract/Point： We study the covering-type k-v...

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

Thesaurus term： *linearity ,  relaxation phenomenon ,  integral ,  *covering ,  integer programming ,  formulation ,  *algorithm ,  NP hard ,  optimum value ,  *approximate algorithm

Author keywords (5)： Approximation algorithms ,  Mixed integer program ,  k-violation linear program ,  Linear relaxation ,  Rounding algorithm

JST classification (1)： Mathematical programmings  (KA03030M)

Terms in the title (2)： 線形 ,  近似アルゴリズム