Solving capacitated clustering problems

DOI10.1016/0377-2217(84)90155-3zbMATH Open0547.62039OpenAlexW2077510448MaRDI QIDQ799059FDOQ799059

Michael Beck, John M. Mulvey

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

Recommendations

• The capacitated centred clustering problem
• Heuristic search to the capacitated clustering problem
• Clustering search algorithm for the capacitated centered clustering problem
• Solving the capacitated clustering problem with variable neighborhood search
• scientific article; zbMATH DE number 7561534
• Using clustering analysis in a capacitated location-routing problem
• Tabu search and GRASP for the capacitated clustering problem
• A scatter search heuristic for the capacitated clustering problem
• A matheuristic for large-scale capacitated clustering

zbMATH Keywords

heuristicsLagrangian relaxationsubgradient algorithmside conditionscapacitated clustering problemspidgin ALGOL

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Printer graphics for clustering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Validation of subgradient optimization
• The traveling-salesman problem and minimum spanning trees: Part II
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• Cluster Analysis: An Application of Lagrangian Relaxation
• A Survey of Lagrangean Techniques for Discrete Optimization
• Title not available (Why is that?)
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
• An Improved Algorithm for the Capacitated Facility Location Problem
• Multivariate Stratified Sampling by Optimization
• A Branch and Bound Algorithm for the p-Median Transportation Problem
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

Cited In (44)

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

This page was built for publication: Solving capacitated clustering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799059)