Binary integer programming solution for troubleshooting with dependent actions

0476547 - ÚTIA 2018 RIV CZ eng J - Článek v odborném periodiku
Lín, Václav
Binary integer programming solution for troubleshooting with dependent actions.
Kybernetika. Roč. 53, č. 3 (2017), s. 493-512. ISSN 0023-5954
Grant CEP: GA ČR GA13-20012S
Institucionální podpora: RVO:67985556
Klíčová slova: binary integer programming * decision-theoretic troubleshooting
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impakt faktor: 0.632, rok: 2017
http://library.utia.cas.cz/separaty/2017/MTR/lin-0476547.pdf

We deal with a sequencing problem that arises when there are multiple repair actions available to fix a broken man-made system and the true cause of the system failure is uncertain. The system is formally described by a probabilistic model, and it is to be repaired by a sequence of troubleshooting actions designed to identify the cause of the malfunction and fix the system. The task is to find a course of repair with minimal expected cost. We propose a binary integer programming formulation for the problem. This can be used to solve the problem directly or to compute lower bounds of the minimal expected cost using linear programming relaxation. We also present three greedy algorithms for computing initial feasible solutions.
Trvalý link: http://hdl.handle.net/11104/0273533