Efficient capacitated clustering algorithm through convex polygon boundary perturbation
From MaRDI portal
Cites work
- A column generation approach to capacitated p-median problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A dual reformulation and solution framework for regularized convex clustering problems
- A matheuristic for large-scale capacitated clustering
- A statistical analysis of simulated annealing applied to the p-median problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Clustering model and algorithm for production inventory and distribution problem
- Density based problem space search for the capacitated clustering p-median problem
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- Hybrid matheuristics for the multi-capacitated clustering problem
- Matheuristics for the capacitated p-Median problem
- Model-based capacitated clustering with posterior regularization
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- Solving capacitated clustering problems
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- The \(p\)-median problem: a survey of metaheuristic approaches
- The capacitated centred clustering problem
- The point of polygon problem for arbitrary polygons
- Using clustering analysis in a capacitated location-routing problem
This page was built for publication: Efficient capacitated clustering algorithm through convex polygon boundary perturbation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346019)
