Cluster Analysis: An Application of Lagrangian Relaxation
DOI10.1287/MNSC.25.4.329zbMATH Open0415.90085OpenAlexW2070276317MaRDI QIDQ3205048FDOQ3205048
Authors: John M. Mulvey, Harlan P. Crowder 
Publication date: 1979
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.25.4.329
cluster analysissubgradient optimizationLagrangian relaxationBoolean programming0-1 integer programminguncapacitated facility locationcomputational experienceshierarchical agglomerative heuristicm-median problemsminimum squared error method
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Boolean programming (90C09)
Cited In (57)
- A novel approach to determine the cell formation using heuristics approach
- Stepwise decomposition approaches for large scale cell formation problems
- Formation of machine cells and part families in cellular manufacturing systems using a linear assignment algorithm.
- A global optimization RLT-based approach for solving the hard clustering problem
- Facility location models for distribution system design
- Clustering on trees
- Optimal partitioning of a data set based on the \(p\)-median model
- A mixed-integer programming approach to the clustering problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- A recursive Lagrangian method for clustering problems
- A Lagrangian treatment of certain nonlinear clustering problems
- Cophenetic-based fuzzy clustering of time series by linear dependency
- Future paths for integer programming and links to artificial intelligence
- Some computational issues in cluster analysis with no a priori metric
- Kohonen maps for solving a class of location-allocation problems
- Exemplar-based clustering via simulated annealing
- Clustering of objects and attributes for manufacturing and marketing applications
- Heuristic approaches for batching jobs in printed circuit board assembly
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- Computational study of large-scale \(p\)-median problems
- Cascading flowlines and layout modules: Practical strategies for machine duplication in facility layouts
- Applying the progressive hedging algorithm to stochastic generalized networks
- Integer programming models for the \(q\)-mode problem
- A Lagrangian search method for the \(P\)-median problem
- Optimization problems for machine learning: a survey
- Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing
- Mean value cross decomposition applied to integer programming problems
- A mathematical programming approach to clusterwise regression model and its extensions
- Solving capacitated clustering problems
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
- Noise fuzzy clustering of time series by autoregressive metric
- Storage assignment and order batching problem in Kiva mobile fulfilment system
- A clustering approach to the planar hub location problem
- On worst-case aggregation analysis for network location problems
- Computing sharp bounds for hard clustering problems on trees
- A comparison of SOM neural network and hierarchical clustering methods
- A New Composite Algorithm for Clustering Problems
- A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems
- Genetic clustering algorithms.
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- The multicovering problem
- A projection method for the uncapacitated facility location problem
- Assignment of tools to machines in a flexible manufacturing system
- An aggregation heuristic for large scale p-median problem
- An extension of the \(p\)-median group technology algorithm
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
- A mixed integer linear model for clustering with variable selection
- A model for the capacitated \(p\)-facility location problem in global environments
- A computational study of a nonlinear minsum facility location problem
- Set partition by globally optimized cluster seed points
- Clustering heuristics for set covering
- Discrete facility location in machine learning
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- Affinity propagation and uncapacitated facility location problems
- P-median problems with an additional constraint on the assignment variables
- A Kemeny distance-based robust fuzzy clustering for preference data
This page was built for publication: Cluster Analysis: An Application of Lagrangian Relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3205048)
