A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(89)90043-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085468551 / rank | |||
Normal rank | |||
Revision as of 01:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition method for minimizing quadratic pseudo-Boolean functions |
scientific article |
Statements
A decomposition method for minimizing quadratic pseudo-Boolean functions (English)
0 references
1989
0 references
A decomposition method is proposed for minimizing quadratic pseudo- Boolean functions. The result is: minimum of \(f=\sum^{q}_{i=1}\) (minimum of \(f_ i)\), where the function f is a sum of quadratic monomials, \(f_ i\) is a sum of monomials of f and each monomial of f appears in at most one \(f_ i\).
0 references
strongly connected components
0 references
quadratic pseudo-Boolean functions
0 references
