Solving capacitated clustering problems

DOI10.1016/0377-2217(84)90155-3zbMath0547.62039OpenAlexW2077510448MaRDI QIDQ799059

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90155-3

zbMATH Keywords

heuristics Lagrangian relaxation subgradient algorithm side conditions capacitated clustering problems pidgin ALGOL

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistics (62-04) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Integer programming (90C10) Probabilistic methods, stochastic differential equations (65C99) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Application of facility location modeling constructs to vendor selection problems, Heuristic search to the capacitated clustering problem, A distributed geographic information system for the daily car pooling problem, STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES, The split delivery vehicle scheduling problem with time windows and grid network distances, Space exploration via proximity search, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, Large-scale pickup and delivery work area design, A Binary Variable Model for Affinity Propagation, A matheuristic for large-scale capacitated clustering, Assignment of tools to machines in a flexible manufacturing system, A spanning tree heuristic for regional clustering, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, Clustering on trees, Discrete facility location in machine learning, Capacitated clustering problems applied to the layout of IT-teams in software factories, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, A Survey of the Generalized Assignment Problem and Its Applications, Semi-supervised \(k\)-means clustering via DC programming approach, Constrained clustering via diagrams: a unified theory and its application to electoral district design, A column generation approach to capacitated \(p\)-median problems, An effective VNS for the capacitated \(p\)-median problem, Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization, Minimizing customers' waiting time in a vehicle routing problem with unit demands, A reactive GRASP with path relinking for capacitated clustering, A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, Greedy random adaptive memory programming search for the capacitated clustering problem, A hybrid heuristic for the maximum dispersion problem, Model-based capacitated clustering with posterior regularization, A new method for solving capacitated location problems based on a set partitioning approach, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, Clustering of objects and attributes for manufacturing and marketing applications, An approximation algorithm for the uniform capacitated \(k\)-means problem, Matheuristics for the capacitated p‐median problem, A scatter search heuristic for the capacitated clustering problem, The capacitated centred clustering problem, Order selection on a single machine with high set-up costs, A heuristic approach to the overnight security service problem, A mathematical programming approach to clusterwise regression model and its extensions

Cites Work