All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Binary integer programming solution for 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_____%2F17%3A00476547" target="_blank" >RIV/67985556:_____/17:00476547 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.14736/kyb-2017-3-0493" target="_blank" >http://dx.doi.org/10.14736/kyb-2017-3-0493</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.14736/kyb-2017-3-0493" target="_blank" >10.14736/kyb-2017-3-0493</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Binary integer programming solution for troubleshooting with dependent actions

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA13-20012S" target="_blank" >GA13-20012S: Conditional independence structures: algebraic and geometric methods</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • 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

  • Name of the periodical

    Kybernetika

  • ISSN

    0023-5954

  • e-ISSN

  • Volume of the periodical

    53

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    20

  • Pages from-to

    493-512

  • UT code for WoS article

    000407667400007

  • EID of the result in the Scopus database

    2-s2.0-85026509110