A matheuristic for large-scale capacitated clustering
From MaRDI portal
Publication:2668749
DOI10.1016/j.cor.2021.105304OpenAlexW2987536913MaRDI QIDQ2668749
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105304
matheuristicbinary linear programmingcapacitated \(p\)-median problemcapacitated centered clustering problemlarge-scale capacitated clustering
Related Items (4)
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ Discrete facility location in machine learning ⋮ An exact algorithm for semi-supervised minimum sum-of-squares clustering ⋮ Semi-supervised \(k\)-means clustering via DC programming approach
Uses Software
Cites Work
- Unnamed Item
- A reactive GRASP with path relinking for capacitated clustering
- Density based problem space search for the capacitated clustering \(p\)-median problem
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Model-based capacitated clustering with posterior regularization
- Solving capacitated clustering problems
- An effective VNS for the capacitated \(p\)-median problem
- Efficient algorithms for the capacitated concentrator location problem
- A bionomic approach to the capacitated \(p\)-median problem
- Analysis of aggregation errors for the \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- Heuristic search to the capacitated clustering problem
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
- Solving the capacitated clustering problem with variable neighborhood search
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
- An aggregation heuristic for large scale p-median problem
- Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
- Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network
- Clustering and portfolio selection problems: a unified framework
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A scatter search heuristic for the capacitated clustering problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- The capacitated centred clustering problem
- A comparative study of different formulations for the capacitated discrete ordered median problem
- Multidimensional binary search trees used for associative searching
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Matheuristics for the capacitated p‐median problem
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- A new method for solving capacitated location problems based on a set partitioning approach
This page was built for publication: A matheuristic for large-scale capacitated clustering
