A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new branch-and-bound algorithm for the maximum edge-weighted clique problem |
scientific article |
Statements
A new branch-and-bound algorithm for the maximum edge-weighted clique problem (English)
0 references
25 June 2019
0 references
combinatorial optimization
0 references
branch-and-bound
0 references
maximum edge-weighted clique problem
0 references
0 references
0 references
0 references
