Algorithms for single-fault troubleshooting with dependent actions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F15%3A00447593" target="_blank" >RIV/67985556:_____/15:00447593 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Algorithms for single-fault troubleshooting with dependent actions
Original language description
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 programmingrelaxation. We present an optimal dynamic programming algorithm, and three greedy algorithms for computing upper bounds of optima.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-20012S" target="_blank" >GA13-20012S: Conditional independence structures: algebraic and geometric methods</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 10th Workshop on Uncertainty Processing WUPES?15
ISBN
978-80-245-2102-2
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
119-130
Publisher name
Oeconomica
Place of publication
Praha
Event location
Monínec
Event date
Sep 16, 2015
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—