Pages that link to "Item:Q2570154"
From MaRDI portal
The following pages link to A scatter search heuristic for the capacitated clustering problem (Q2570154):
Displaying 12 items.
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
- Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)