0447593 20240103210628.420150925235959.9 12 s. P cav_un_epca*0447898978-80-245-2102-2119-130PrahaOeconomica2015KratochvílV. single-fault troubleshooting algorithms linear programming relaxation cav_un_auth*0272969 Lín Václav Matematická teorie rozhodování Department of Decision Making Theory MTR MTR UTIA-B Department of Decision Making Theory Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2015/MTR/lin-0447593.pdf GA13-20012S GA ČR cav_un_auth*0292670 We study the problem of single-fault troubleshooting with dependent actions. 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 optima using linear programming relaxation. We present an optimal dynamic programming algorithm, and three greedy algorithms for computing upper bounds of optima. cav_un_auth*0319735 WUPES 2015. Workshop on Uncertainty Processing /10./ Monínec 16.09.2015-19.09.2015 CZ 2016 BB PR RVO:67985556 http://hdl.handle.net/11104/0249565 S 2015 cav_un_epca*0447898 Proceedings of the 10th Workshop on Uncertainty Processing WUPES’15 978-80-245-2102-2 119 130 Praha Oeconomica 2015 Kratochvíl V. 340