A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems (Q1288467): Difference between revisions
From MaRDI portal
Created a new Item |
Add wikidata reference. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINTO / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1009725216438 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1581661059 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60309085 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:38, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems |
scientific article |
Statements
A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems (English)
0 references
9 February 2001
0 references
MAX-SAT and weighted MAX-SAT problems
0 references
heuristic
0 references
integer programming
0 references
branch-and-cut algorithm
0 references
