A branch and bound algorithm for the maximum clique problem (Q5905591): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Revision as of 01:38, 1 March 2024
scientific article; zbMATH DE number 95834
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the maximum clique problem |
scientific article; zbMATH DE number 95834 |
Statements
A branch and bound algorithm for the maximum clique problem (English)
0 references
16 January 1993
0 references
maximum clique
0 references
unconstrained quadratic zero-one programming
0 references
branch-and- bound
0 references
