Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912)
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: Solving the maximum edge-weight clique problem in sparse graphs with compact formulations |
scientific article; zbMATH DE number 6414077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the maximum edge-weight clique problem in sparse graphs with compact formulations |
scientific article; zbMATH DE number 6414077 |
Statements
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (English)
0 references
12 March 2015
0 references
maximum edge-weight clique problem
0 references
clique's edge neighborhood
0 references
integer formulations
0 references
sparse graphs
0 references
0 references
0 references
0 references
0.93090355
0 references
0.9203563
0 references
0.91855663
0 references
0.91210824
0 references
0.9083197
0 references
0.9078405
0 references
