Cluster Analysis: An Application of Lagrangian Relaxation
From MaRDI portal
Publication:3205048
DOI10.1287/mnsc.25.4.329zbMath0415.90085OpenAlexW2070276317MaRDI QIDQ3205048
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
Lagrangian relaxationcluster analysisBoolean programmingsubgradient optimization0-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)
Related Items
Storage assignment and order batching problem in Kiva mobile fulfilment system, Solving the \(p\)-median problem with a semi-Lagrangian relaxation, Cascading flowlines and layout modules: Practical strategies for machine duplication in facility layouts, A mixed integer linear model for clustering with variable selection, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, A recursive Lagrangian method for clustering problems, The \(p\)-median problem: a survey of metaheuristic approaches, Heuristic approaches for batching jobs in printed circuit board assembly, Computational study of large-scale \(p\)-median problems, A model for the capacitated \(p\)-facility location problem in global environments, A Lagrangian search method for the \(P\)-median problem, Integer programming models for the \(q\)-mode problem, Assignment of tools to machines in a flexible manufacturing system, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, Clustering on trees, Discrete facility location in machine learning, A Kemeny distance-based robust fuzzy clustering for preference data, Formation of machine cells and part families in cellular manufacturing systems using a linear assignment algorithm., A Lagrangian treatment of certain nonlinear clustering problems, A New Composite Algorithm for Clustering Problems, A projection method for the uncapacitated facility location problem, Some computational issues in cluster analysis with no a priori metric, Affinity propagation: An exemplar‐based tool for clustering in psychological research, A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, Noise fuzzy clustering of time series by autoregressive metric, Cophenetic-based fuzzy clustering of time series by linear dependency, Optimal partitioning of a data set based on the \(p\)-median model, On worst-case aggregation analysis for network location problems, A clustering approach to the planar hub location problem, The multicovering problem, Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing, A computational study of a nonlinear minsum facility location problem, An aggregation heuristic for large scale p-median problem, Facility location models for distribution system design, Genetic clustering algorithms., Optimization problems for machine learning: a survey, Affinity propagation and uncapacitated facility location problems, Stepwise decomposition approaches for large scale cell formation problems, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, A comparison of SOM neural network and hierarchical clustering methods, Future paths for integer programming and links to artificial intelligence, Computing sharp bounds for hard clustering problems on trees, Mean value cross decomposition applied to integer programming problems, P-Median Problems with an Additional Constraint on the Assignment Variables, A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems, Exemplar-based clustering via simulated annealing, Clustering of objects and attributes for manufacturing and marketing applications, A novel approach to determine the cell formation using heuristics approach, Kohonen maps for solving a class of location-allocation problems, A mixed-integer programming approach to the clustering problem, A global optimization RLT-based approach for solving the hard clustering problem, Solving capacitated clustering problems, Clustering heuristics for set covering, An extension of the \(p\)-median group technology algorithm, Set partition by globally optimized cluster seed points, Applying the progressive hedging algorithm to stochastic generalized networks, A mathematical programming approach to clusterwise regression model and its extensions
