New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411)
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: New facets and a branch-and-cut algorithm for the weighted clique problem. |
scientific article; zbMATH DE number 2035748
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New facets and a branch-and-cut algorithm for the weighted clique problem. |
scientific article; zbMATH DE number 2035748 |
Statements
New facets and a branch-and-cut algorithm for the weighted clique problem. (English)
0 references
2 February 2004
0 references
Combinatorial optimization
0 references
Boolean quadratic problem
0 references
Edge-weighted clique
0 references
problem
0 references
Maximum dispersion problem
0 references
Polyhedra
0 references
0 references
0 references
