scientific article; zbMATH DE number 3617544
From MaRDI portal
Publication:4181272
zbMath0397.68044MaRDI QIDQ4181272
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Operations research and management science (90B99)
Related Items (46)
Point clustering via voting maximization ⋮ 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 ⋮ Kinetic clustering of points on the line ⋮ On the complexity of some quadratic Euclidean 2-clustering problems ⋮ Optimal separable partitioning in the plane ⋮ Trajectory clustering of points in \(\mathbb{R}\) ⋮ Large-scale pickup and delivery work area design ⋮ Cluster analysis and mathematical programming ⋮ The hyperbolic smoothing clustering method ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ \(\alpha\)-concave hull, a generalization of convex hull ⋮ Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering ⋮ On the complexity of redescription mining ⋮ Exact pseudopolynomial algorithms for a balanced 2-clustering problem ⋮ Fragmentary structures in discrete optimization problems ⋮ Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters ⋮ Clustering of distributions: A case of patent citations ⋮ Optimization heuristics for determining internal rating grading scales ⋮ Efficient algorithms for divisive hierarchical clustering with the diameter criterion ⋮ Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center ⋮ Design of hybrids for the minimum sum-of-squares clustering problem ⋮ Clustering financial time series: an application to mutual funds style analysis ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ Differential evolution and particle swarm optimisation in partitional clustering ⋮ Combinatorial optimisation and hierarchical classifications ⋮ A reactive GRASP with path relinking for capacitated clustering ⋮ A scatter search approach for the minimum sum-of-squares clustering problem ⋮ Greedy random adaptive memory programming search for the capacitated clustering problem ⋮ On the information and representation of non-Euclidean pairwise data ⋮ Genetic clustering algorithms. ⋮ A polynomial algorithm for balanced clustering via graph partitioning ⋮ J-MEANS: A new local search heuristic for minimum sum of squares clustering ⋮ A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning ⋮ A new binary adaptive elitist differential evolution based automatic \(k\)-medoids clustering for probability density functions ⋮ Clustering data with measurement errors ⋮ Using differential evolution to improve the accuracy of bank rating systems ⋮ Norm statistics and the complexity of clustering problems ⋮ A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering ⋮ A tabu search approach for the minimum sum-of-squares clustering problem ⋮ Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space ⋮ Clustering to minimize the maximum intercluster distance ⋮ The capacitated centred clustering problem ⋮ Set partition by globally optimized cluster seed points ⋮ Experiments with a Non-convex Variance-Based Clustering Criterion ⋮ Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems
This page was built for publication:
