An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596)
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: An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem |
scientific article |
Statements
An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (English)
0 references
14 February 2019
0 references
combinatorial optimization
0 references
maximum satisfiability
0 references
local search
0 references
path-breaking
0 references
mutation
0 references
0 references
0 references
0.7764321565628052
0 references
0.7589627504348755
0 references
0.7582650780677795
0 references
0.7443859577178955
0 references
