On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.cor.2017.02.017 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.COR.2017.02.017 / rank | |||
Normal rank |
Latest revision as of 01:06, 11 December 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
0 references
0 references