Pages that link to "Item:Q2261029"

The following pages link to A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning (Q2261029):

Displayed 12 items.

• Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (Q288987) ‎ (← links)
• Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) ‎ (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) ‎ (← links)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) ‎ (← links)
• Optimal partitioning of a data set based on the \(p\)-median model (Q946677) ‎ (← links)
• Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) ‎ (← links)
• Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression (Q1761225) ‎ (← links)
• Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) ‎ (← links)
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) ‎ (← links)
• An Exact Algorithm for Blockmodeling of Two-Mode Network Data (Q2857671) ‎ (← links)
• Qualitative properties of the minimum sum-of-squares clustering problem (Q5121778) ‎ (← links)
• An exact algorithm for the two-mode \(KL\)-means partitioning problem (Q5964470) ‎ (← links)