AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: AND/OR branch-and-bound search for combinatorial optimization in graphical models |
scientific article; zbMATH DE number 5650762
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AND/OR branch-and-bound search for combinatorial optimization in graphical models |
scientific article; zbMATH DE number 5650762 |
Statements
AND/OR branch-and-bound search for combinatorial optimization in graphical models (English)
0 references
21 December 2009
0 references
search
0 references
AND/OR search
0 references
decomposition
0 references
graphical models
0 references
Bayesian networks
0 references
constraint networks
0 references
constraint optimization
0 references
0 references
