Pages that link to "Item:Q4509784"

The following pages link to An Interior Point Algorithm for Minimum Sum-of-Squares Clustering (Q4509784):

Displaying 35 items.

• Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• Sequential clustering with radius and split criteria (Q351557) (← links)
• Column generation bounds for numerical microaggregation (Q486386) (← links)
• Fast modified global \(k\)-means algorithm for incremental cluster construction (Q621088) (← links)
• Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) (← links)
• Variable neighborhood search for harmonic means clustering (Q636511) (← 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)
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems (Q936447) (← links)
• Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
• Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
• Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474) (← links)
• K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
• Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
• Taxicab correspondence analysis (Q2261028) (← links)
• An incremental clustering algorithm based on hyperbolic smoothing (Q2340498) (← links)
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
• Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) (← links)
• A scatter search approach for the minimum sum-of-squares clustering problem (Q2485180) (← links)
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) (← links)
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
• The hyperbolic smoothing clustering method (Q2654237) (← links)
• An exact algorithm for semi-supervised minimum sum-of-squares clustering (Q2676354) (← links)
• An Exact Algorithm for Blockmodeling of Two-Mode Network Data (Q2857671) (← links)
• Improving spectral bounds for clustering problems by Lagrangian relaxation (Q4918244) (← links)
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
• Qualitative properties of the minimum sum-of-squares clustering problem (Q5121778) (← links)
• An algorithm for minimizing clustering functions (Q5317732) (← links)
• Variable neighborhood search: Principles and applications (Q5937708) (← links)
• Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)