A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem (Q4367040)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1091251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem |
scientific article; zbMATH DE number 1091251 |
Statements
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem (English)
0 references
25 November 1997
0 references
branch-and-bound
0 references
clustering
0 references
edge-weighted graphs
0 references
heuristics
0 references
0.8344937562942505
0 references
0.8000198006629944
0 references
0.7835348844528198
0 references
