Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032)
From MaRDI portal
| File:Ambox important.svg | 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 via unconstrained quadratic programming |
scientific article; zbMATH DE number 5144958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the maximum edge weight clique problem via unconstrained quadratic programming |
scientific article; zbMATH DE number 5144958 |
Statements
Solving the maximum edge weight clique problem via unconstrained quadratic programming (English)
0 references
19 April 2007
0 references
metaheuristics
0 references
combinatorial optimization
0 references
integer programming
0 references
0 references
0 references
0.8219476938247681
0 references
0.815193772315979
0 references
0.8007664680480957
0 references
0.8000461459159851
0 references
0.7791255712509155
0 references
