A refined branching algorithm for the maximum satisfiability problem (Q2118385)
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: A refined branching algorithm for the maximum satisfiability problem |
scientific article; zbMATH DE number 7495631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A refined branching algorithm for the maximum satisfiability problem |
scientific article; zbMATH DE number 7495631 |
Statements
A refined branching algorithm for the maximum satisfiability problem (English)
0 references
22 March 2022
0 references
maximum satisfiability
0 references
branching algorithms
0 references
exact algorithms
0 references
0 references
0 references
0.8782405257225037
0 references
0.8576182723045349
0 references
0.833674967288971
0 references
0.8226962089538574
0 references
