Pages that link to "Item:Q4367040"
From MaRDI portal
The following pages link to A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem (Q4367040):
Displayed 9 items.
- Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods (Q1037693) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- Taxicab correspondence analysis (Q2261028) (← links)
- Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) (← links)
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data (Q2857671) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- An exact algorithm for the two-mode \(KL\)-means partitioning problem (Q5964470) (← links)