抄録
This paper addresses a problem to decide the combination of risk-reducing plans quickly. The combinatorial problem is formulated as one of the 0-1 integer programming, and Branch and Bound is used. However, Simplex method that is executed on Branch and Bound takes much time. Our proposed method decides the optimal combination based on approximation algorithms, greedy algorithm and single constraint selection in addition to Simplex method. Only if bounding by approximate algorithms leads to incorrect optimal solutions, Simplex method is executed to verify the bounding. As a result of evaluation experiments, the proposed method can reduce the computational time by 71% in comparison with the existing method.
