Pages that link to "Item:Q951921"
From MaRDI portal
The following pages link to Design of hybrids for the minimum sum-of-squares clustering problem (Q951921):
Displaying 15 items.
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- A hybrid stochastic genetic-GRASP algorithm for clustering analysis (Q949381) (← links)
- Applications of optimization heuristics to estimation and modelling problems (Q957002) (← links)
- Experiments with, and on, algorithms for maximum likelihood clustering (Q957004) (← links)
- Linear grouping using orthogonal regression (Q959227) (← links)
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal (Q998835) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
- On strategies to fix degenerate \(k\)-means solutions (Q2403298) (← links)
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices (Q2462311) (← 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)
- The hyperbolic smoothing clustering method (Q2654237) (← links)
- Algorithms with greedy heuristic procedures for mixture probability distribution separation (Q3388410) (← links)
