A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2009.06.043 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2009.06.043 / rank | |||
Normal rank | |||
Revision as of 08:37, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem |
scientific article |
Statements
A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (English)
0 references
14 October 2009
0 references
artificial intelligence
0 references
satisfiability
0 references
Max-SAT
0 references
branch-and-bound
0 references
tabu search
0 references
0 references
0 references
