Pages that link to "Item:Q1038295"
From MaRDI portal
The following pages link to Clustering search algorithm for the capacitated centered clustering problem (Q1038295):
Displaying 8 items.
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
- A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- A clustering search metaheuristic for the point-feature cartographic label placement problem (Q2514783) (← links)
- Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)