Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012)
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: Efficient branch-and-bound algorithms for weighted MAX-2-SAT |
scientific article; zbMATH DE number 5886687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient branch-and-bound algorithms for weighted MAX-2-SAT |
scientific article; zbMATH DE number 5886687 |
Statements
Efficient branch-and-bound algorithms for weighted MAX-2-SAT (English)
0 references
11 May 2011
0 references
MAX-2-SAT
0 references
NP-hard
0 references
branch-and-bound
0 references
lower bounds
0 references
directed graph
0 references
0 references
0 references
0.85929274559021
0 references
0.8365631103515625
0 references
0.8359560370445251
0 references
0.8332793116569519
0 references
0.8311075568199158
0 references
