Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6708748 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
constraint optimization | |||
| Property / zbMATH Keywords: constraint optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
satisfiability | |||
| Property / zbMATH Keywords: satisfiability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum satisfiability | |||
| Property / zbMATH Keywords: maximum satisfiability / rank | |||
Normal rank | |||
Revision as of 06:24, 1 July 2023
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
