A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944)
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: A cutting-plane approach to the edge-weighted maximal clique problem |
scientific article; zbMATH DE number 474806
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cutting-plane approach to the edge-weighted maximal clique problem |
scientific article; zbMATH DE number 474806 |
Statements
A cutting-plane approach to the edge-weighted maximal clique problem (English)
0 references
20 December 1993
0 references
The following maximal clique problem is considered. Given a complete undirected graph \(G\) with real edge-weights, find a clique \(C\) in \(G\) such that the sum of edge-weights in \(C\) is maximal. It is shown that contrary to the fact that cutting planes algorithms have been successfully applied to related problems like the edge-weighted partition problem or the linear ordering problem similar methods applied to the maximal clique problem fails. A computational study shows that even for graphs with 15 or 25 vertices the results are very poor.
0 references
maximal clique problem
0 references
complete undirected graph
0 references
cutting planes
0 references
0 references
0.9315113
0 references
0.9201781
0 references
0.9195795
0 references
0.9146684
0 references
0.91210824
0 references
0 references
0.9086671
0 references
