Pages that link to "Item:Q4367040"

The following pages link to A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem (Q4367040):

Displaying 14 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)
• A parallel branch-and-bound method for cluster analysis (Q1808189) (← 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)
• Box-bisection for solving second-degree systems and the problem of clustering (Q3776505) (← links)
• The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
• A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
• Evaluation of a Branch and Bound Algorithm for Clustering (Q5186698) (← links)
• An exact algorithm for the two-mode \(KL\)-means partitioning problem (Q5964470) (← links)
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)