Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10732-015-9300-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10732-015-9300-7 / rank | |||
Normal rank | |||
Latest revision as of 20:29, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting subproblem optimization in SAT-based maxsat algorithms |
scientific article |
Statements
Exploiting subproblem optimization in SAT-based maxsat algorithms (English)
0 references
28 April 2017
0 references
constraint optimization
0 references
satisfiability
0 references
maximum satisfiability
0 references
0 references
