High-speed decision method of combination of risk-reducing plans using Branch and Bound

@article{Kawaratani2010HighspeedDM,
  title={High-speed decision method of combination of risk-reducing plans using Branch and Bound},
  author={K. Kawaratani and Koji Itakura and Masaki Samejima and Masanori Akiyoshi},
  journal={2010 8th IEEE International Conference on Industrial Informatics},
  year={2010},
  pages={379-383}
}
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 applied. On Branch and Bound, Simplex method for deciding a branching variable and the lower bound, which takes much time. Therefore, we propose the high-speed decision… CONTINUE READING