Inference in credal networks with branch-and-bound algorithms
José Carlos Ferreira da Rocha, Fábio Gagliardi Cozman · 2003
A credal network associates sets of probability distributions with directed acyclic graphs. Under strong independence assumptions, inference with credal networks is equivalent to a signomial program under linear constraints, a problem that is NP-hard even for categorical variables and polytree models. We describe