Pages that link to "Item:Q636511"
From MaRDI portal
The following pages link to Variable neighborhood search for harmonic means clustering (Q636511):
Displaying 12 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
- New heuristic for harmonic means clustering (Q887198) (← links)
- \(K\)-harmonic means data clustering with tabu-search method (Q949929) (← links)
- Candidate groups search for K-harmonic means data clustering (Q1792370) (← links)
- Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
- Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
- Clustering cities based on their development dynamics and variable neigborhood search (Q2631267) (← links)
- Decomposition/Aggregation K-means for Big Data (Q4965129) (← links)
- Determining the Set of the Most Critical System Components—Optimization Approach (Q5110856) (← links)
- Arbitrary-norm hyperplane separation by variable neighbourhood search (Q5432694) (← links)
