On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309)
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: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem |
scientific article; zbMATH DE number 6901426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem |
scientific article; zbMATH DE number 6901426 |
Statements
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (English)
0 references
11 July 2018
0 references
maximum clique problem
0 references
branch-and-bound
0 references
branching ordering
0 references
incremental maxsat reasoning
0 references
0 references
0 references
0.94888496
0 references
0.94888496
0 references
0.9367324
0 references
0.9329293
0 references
0.9255836
0 references
0.9226099
0 references
