On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MaxCliqueDyn / rank | |||
Normal rank | |||
Revision as of 13:36, 29 February 2024
scientific article
| 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 |
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
