| bibtype |
J -
Journal Article
|
| ARLID |
0476547 |
| utime |
20240903170637.0 |
| mtime |
20170728235959.9 |
| SCOPUS |
85026509110 |
| WOS |
000407667400007 |
| DOI |
10.14736/kyb-2017-3-0493 |
| title
(primary) (eng) |
Binary integer programming solution for troubleshooting with dependent actions |
| specification |
| page_count |
20 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0297163 |
| ISSN |
0023-5954 |
| title
|
Kybernetika |
| volume_id |
53 |
| volume |
3 (2017) |
| page_num |
493-512 |
| publisher |
| name |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
|
| keyword |
binary integer programming |
| keyword |
decision-theoretic troubleshooting |
| author
(primary) |
| ARLID |
cav_un_auth*0272969 |
| full_dept (cz) |
Matematická teorie rozhodování |
| full_dept (eng) |
Department of Decision Making Theory |
| department (cz) |
MTR |
| department (eng) |
MTR |
| full_dept |
Department of Decision Making Theory |
| share |
100 |
| name1 |
Lín |
| name2 |
Václav |
| institution |
UTIA-B |
| country |
CZ |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| cas_special |
| project |
| ARLID |
cav_un_auth*0292670 |
| project_id |
GA13-20012S |
| agency |
GA ČR |
|
| abstract
(eng) |
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. |
| RIV |
JD |
| FORD0 |
10000 |
| FORD1 |
10200 |
| FORD2 |
10201 |
| reportyear |
2018 |
| num_of_auth |
1 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0273533 |
| mrcbC62 |
1 |
| confidential |
S |
| mrcbC86 |
3+4 Article Computer Science Cybernetics |
| mrcbC86 |
3+4 Article Computer Science Cybernetics |
| mrcbC86 |
3+4 Article Computer Science Cybernetics |
| mrcbT16-e |
COMPUTERSCIENCECYBERNETICS |
| mrcbT16-j |
0.224 |
| mrcbT16-s |
0.321 |
| mrcbT16-B |
18.907 |
| mrcbT16-D |
Q4 |
| mrcbT16-E |
Q3 |
| arlyear |
2017 |
| mrcbU14 |
85026509110 SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
000407667400007 WOS |
| mrcbU63 |
cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 53 č. 3 2017 493 512 Ústav teorie informace a automatizace AV ČR, v. v. i. |
|