Pages that link to "Item:Q2355953"

The following pages link to Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953):

Displaying 13 items.

• Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
• J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
• Dominant-set clustering: a review (Q1754006) (← links)
• Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders (Q2029376) (← links)
• Optimization problems for machine learning: a survey (Q2029894) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• Exponential quality function for community detection in complex networks (Q6088242) (← links)
• On mathematical optimization for clustering categories in contingency tables (Q6106171) (← links)