scientific article; zbMATH DE number 5957368

MaRDI QIDQ3093394zbMATH OpenFDO

Authors Anders Bergkvist, Peter Damaschke, Marcel Lüthi

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/bergkvist06a.html

zbMATH Keywords

cycle-free graphserror probabilitylinear programmingnetwork flows

Mathematics Subject Classification ID

Applications of statistics (62P99) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Probabilistic Models for Linear Programming
• A linear programming approach to reasoning about probabilities
• scientific article; zbMATH DE number 3928425
• Probabilistic linear solvers: a unifying view
• Linear Response Algorithms for Approximate Inference in Graphical Models
• Approximating credal network inferences by linear programming
• scientific article; zbMATH DE number 1098822

Cited in

(4)

• Ranking hypotheses to minimize the search cost in probabilistic inference models
• Probabilistic Models for Linear Programming
• Linear Response Algorithms for Approximate Inference in Graphical Models
• On solving probabilistic linear Diophantine equations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093394)