Pages that link to "Item:Q5186698"
From MaRDI portal
The following pages link to Evaluation of a Branch and Bound Algorithm for Clustering (Q5186698):
Displayed 13 items.
- Fast modified global \(k\)-means algorithm for incremental cluster construction (Q621088) (← links)
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems (Q936447) (← links)
- Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) (Q1433467) (← links)
- A scatter search approach for the minimum sum-of-squares clustering problem (Q2485180) (← links)
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation (Q2497271) (← 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 capacitated centred clustering problem (Q2581607) (← links)
- An algorithm for minimizing clustering functions (Q5317732) (← links)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering (Q5957595) (← links)