Cluster Analysis and Mathematical Programming
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- Computing sharp bounds for hard clustering problems on trees
- Exemplar-based clustering via simulated annealing
- A shortest-route approach for optimum aggregation of data with an application to income data
- A recursive Lagrangian method for clustering problems
- The weighted sum of split and diameter clustering
- A combined hierarchical and steepest-descent clustering algorithm
- Clusteranalyse - Überblick und neuere Entwicklungen
- Geography, games and graphs
- A Lagrangian treatment of certain nonlinear clustering problems
- Simple but powerful goal programming models for discriminant problems
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
- Fuzzy classifications
- Cluster generation and grouping using mathematical programming
- Numerical taxonomy with fuzzy sets
- Optimal realignments of the teams in the National Football League
- A comparison of SOM neural network and hierarchical clustering methods
- Dynamic programming and convex clustering
- Partitioning of sequentially ordered systems using linear programming
- Cluster analysis and mathematical programming
- Clustering on trees
- Clustering of objects and attributes for manufacturing and marketing applications
- A mathematical programming approach to clusterwise regression model and its extensions
- Making a state-of-the-art heuristic faster with data mining
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- On the complexity of clustering with relaxed size constraints in fixed dimension
- A novel mixed integer linear programming model for clustering relational networks
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
- An aggregation heuristic for large scale p-median problem
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
- An effective algorithm for globally solving sum of linear ratios problems
- Parametric linear programming and cluster analysis
- Future paths for integer programming and links to artificial intelligence
- Optimal clustering of fuzzy data via fuzzy dynamic programming
- Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
- A deterministic method for solving the sum of linear ratios problem
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- Cophenetic-based fuzzy clustering of time series by linear dependency
- Taxicab correspondence analysis
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
- Integral simplex using double decomposition for set partitioning problems
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- On polynomial solvability of one quadratic Euclidean clustering problem on a line
- Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem
- A randomized algorithm for two-cluster partition of a set of vectors
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Investigation of a new GRASP-based clustering algorithm applied to biological data
- A new efficient algorithm based on DC programming and DCA for clustering
- On solving the sum-of-ratios problem
- Seasonal clustering technique for time series data
- A biased random-key genetic algorithm for data clustering
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- Solving sum of ratios fractional programs via concave minimization
- Operations research and data mining
- Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- Espaliers: A generalization of dendrograms
- A global optimization RLT-based approach for solving the hard clustering problem
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- Capacitated clustering problems applied to the layout of IT-teams in software factories
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- A Kemeny distance-based robust fuzzy clustering for preference data
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- On the Complexity of Clustering with Relaxed Size Constraints
- An approximation algorithm for clustering graphs with dominating diametral path
- Exact pseudo-polynomial algorithms for a balanced 2-clustering problem
- 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 practicable branch and bound algorithm for sum of linear ratios problem
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- A mixed integer linear model for clustering with variable selection
- Exact and approximate methods for a one-dimensional minimax bin-packing problem
- The unconstrained binary quadratic programming problem: a survey
- A New Composite Algorithm for Clustering Problems
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
- Noise fuzzy clustering of time series by autoregressive metric
- Probabilistic stopping rules for GRASP heuristics and extensions
- Exact algorithm for the one-dimensional quadratic Euclidean cardinality-weighted 2-clustering with given center problem
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- The ratio-cut polytope and K-means clustering
- Determining an estimate of an equivalence relation for moderate and large sized sets
- K-medoids inverse regression
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- 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
- The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension
- An FPTAS for a vector subset search problem
- A revised Taha's algorithm for polynomial 0-1 programming
- A column generation approach for the maximal covering location problem
- Minimum sum of diameters clustering
- Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
- Clustering by a fuzzy metric
- Affinity propagation and uncapacitated facility location problems
This page was built for publication: Cluster Analysis and Mathematical Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650508)
