Cluster Analysis and Mathematical Programming

DOI10.2307/2283542zbMath0238.90042OpenAlexW4238194826MaRDI QIDQ5650508

No author found.

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2283542

Related Items

The Ratio-Cut Polytope and K-Means Clustering, K-medoids inverse regression, SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering, On clustering and interpreting with rules by means of mathematical optimization, An exact method for solving the integer sum of linear ratios problem, Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case, Identifying Fixations in Gaze Data via Inner Density and Optimization, Clustering by a fuzzy metric, A revised Taha's algorithm for polynomial 0-1 programming, Unnamed Item, A column generation approach for the maximal covering location problem, Affinity propagation and uncapacitated facility location problems, The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension, Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations, An FPTAS for a vector subset search problem, Regional division and reduction algorithm for minimizing the sum of linear fractional functions, A shortest-route approach for optimum aggregation of data with an application to income data, Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems, An approximation algorithm for clustering graphs with dominating diametral path, Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing, Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem, Making a state-of-the-art heuristic faster with data mining, Investigation of a new GRASP-based clustering algorithm applied to biological data, A practicable branch and bound algorithm for sum of linear ratios problem, A new efficient algorithm based on DC programming and DCA for clustering, A reduced space branch and bound algorithm for a class of sum of ratios problems, A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum, An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors, A mixed integer linear model for clustering with variable selection, Partitioning of sequentially ordered systems using linear programming, Cluster analysis and mathematical programming, A recursive Lagrangian method for clustering problems, Computational study of large-scale \(p\)-median problems, Exact and approximate methods for a one-dimensional minimax bin-packing problem, The weighted sum of split and diameter clustering, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, Nonlinear 0–1 programming: II. Dominance relations and algorithms, An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems, Clustering on trees, Capacitated clustering problems applied to the layout of IT-teams in software factories, An exact algorithm for semi-supervised minimum sum-of-squares clustering, The unconstrained binary quadratic programming problem: a survey, A Kemeny distance-based robust fuzzy clustering for preference data, A combined hierarchical and steepest-descent clustering algorithm, On solving the sum-of-ratios problem, An optimising approach to alternative clustering schemes, Clusteranalyse - Überblick und neuere Entwicklungen, Exact pseudopolynomial algorithms for a balanced 2-clustering problem, Geography, games and graphs, Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering, A Lagrangian treatment of certain nonlinear clustering problems, Simple but powerful goal programming models for discriminant problems, Effective algorithm and computational complexity for solving sum of linear ratios problem, Seasonal clustering technique for time series data, On the complexity of clustering with relaxed size constraints in fixed dimension, A biased random-key genetic algorithm for data clustering, A New Composite Algorithm for Clustering Problems, A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets, A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension, Affinity propagation: An exemplar‐based tool for clustering in psychological research, Efficient algorithms for divisive hierarchical clustering with the diameter criterion, Noise fuzzy clustering of time series by autoregressive metric, Cophenetic-based fuzzy clustering of time series by linear dependency, Solving sum of ratios fractional programs via concave minimization, Optimal partitioning of a data set based on the \(p\)-median model, A novel mixed integer linear programming model for clustering relational networks, Operations research and data mining, Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center, Enumeration of the partitions with minimum diameter, A clustering approach to the planar hub location problem, Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing, A deterministic method for solving the sum of linear ratios problem, An aggregation heuristic for large scale p-median problem, Pseudo-Boolean optimization, Probabilistic stopping rules for GRASP heuristics and extensions, Taxicab correspondence analysis, Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems, Synergies of operations research and data mining, Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs, Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices, A mixed-integer programming approach to the clustering problem with an application in customer segmentation, Integral simplex using double decomposition for set partitioning problems, Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations, Minimum sum of diameters clustering, Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria, Fuzzy classifications, On polynomial solvability of one quadratic Euclidean clustering problem on a line, Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem, Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem, Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region, An effective algorithm for globally solving sum of linear ratios problems, Cluster generation and grouping using mathematical programming, Numerical taxonomy with fuzzy sets, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem, Parametric linear programming and cluster analysis, Optimal realignments of the teams in the National Football League, A comparison of SOM neural network and hierarchical clustering methods, A linearization framework for unconstrained quadratic (0-1) problems, Norm statistics and the complexity of clustering problems, Solving sum of quadratic ratios fractional programs via monotonic function, Future paths for integer programming and links to artificial intelligence, Optimal clustering of fuzzy data via fuzzy dynamic programming, Computing sharp bounds for hard clustering problems on trees, On the Complexity of Clustering with Relaxed Size Constraints, Exemplar-based clustering via simulated annealing, Clustering of objects and attributes for manufacturing and marketing applications, Espaliers: A generalization of dendrograms, A global optimization RLT-based approach for solving the hard clustering problem, Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection, Dynamic programming and convex clustering, Set partition by globally optimized cluster seed points, A randomized algorithm for two-cluster partition of a set of vectors, A mathematical programming approach to clusterwise regression model and its extensions, Univariate parameterization for global optimization of mixed-integer polynomial problems