CiNii
Takazawa Yotaro , Mizuno Shinji
数理解析研究所講究録 (2027), 10-14, 2017-04
… The covering 0-1 integer program is a generalization of fundamental combinatorial optimization problems such as the vertex cover problem, the set cover problem, and the minimum knapsack problem. …
IR
… Generalizing the proposed algorithm, we also present an approximation algorithm for the covering integer program with 0-1 variables.</p> …
Journal of the Operations Research Society of Japan 60(1), 15-23, 2017
J-STAGE
SATO Keisuke , FUKUMURA Naoto
… We construct a network from the disrupted situation, and model the problem as an integer programming problem with set-covering constraints combined with set-partitioning constraints. … The integer program is solved by column generation in which we reduce the column generation subproblem to a shortest path problem and such paths by utilizing data parallelism. …
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 94(6), 1222-1229, 2011-06-01
J-STAGE References (17)