Pages that link to "Item:Q2581607"

The following pages link to The capacitated centred clustering problem (Q2581607):

Displaying 15 items.

• Large-scale pickup and delivery work area design (Q339655) (← links)
• A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
• Evacuation planning using multiobjective evolutionary optimization approach (Q1027631) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
• Clusters with minimum transportation cost to centers: a case study in corn production management (Q1656940) (← links)
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← 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 matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)
• Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)