Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533)
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: Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? |
scientific article; zbMATH DE number 2173274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? |
scientific article; zbMATH DE number 2173274 |
Statements
Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (English)
0 references
1 June 2005
0 references
Maximum satisfiability
0 references
Tabu search
0 references
Local search
0 references
Worst-case analysis
0 references
0 references
0.8593361973762512
0 references
0.7834124565124512
0 references
0.7834124565124512
0 references
0.7711717486381531
0 references
