Satisfiability-based algorithms for Boolean optimization (Q1430296)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2069243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Satisfiability-based algorithms for Boolean optimization |
scientific article; zbMATH DE number 2069243 |
Statements
Satisfiability-based algorithms for Boolean optimization (English)
0 references
27 May 2004
0 references
binate covering problem
0 references
propositional satisfiability
0 references
branch-and-bound
0 references
backtrack search
0 references
non-chronological backtracking
0 references
0.7845160961151123
0 references
0.7808513045310974
0 references
0.761182427406311
0 references
0.7555366158485413
0 references
0.7545816898345947
0 references
