An improved column generation algorithm for minimum sum-of-squares clustering
From MaRDI portal
Recommendations
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- scientific article; zbMATH DE number 7416587
- Constrained Clustering Using Column Generation
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- scientific article; zbMATH DE number 5957421 (Why is no real title available?)
- scientific article; zbMATH DE number 3129892 (Why is no real title available?)
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 1302175 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 2222601 (Why is no real title available?)
- A Branch and Bound Clustering Algorithm
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Dynamic Programming Algorithm for Cluster Analysis
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A global optimization RLT-based approach for solving the hard clustering problem
- A new efficient algorithm based on DC programming and DCA for clustering
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- A scatter search approach for the minimum sum-of-squares clustering problem
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering
- Cluster analysis and mathematical programming
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Design of hybrids for the minimum sum-of-squares clustering problem
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Evaluation of a Branch and Bound Algorithm for Clustering
- Fuzzy Sets and Decisionmaking Approaches in Vowel and Speaker Recognition
- Heuristic methods for large centroid clustering problems
- Improving dynamic programming strategies for partitioning
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Mathematical classification and clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- NP-hardness of Euclidean sum-of-squares clustering
- Numerical methods for fuzzy clustering
- On Nonlinear Fractional Programming
- Reformulations in Mathematical Programming: Definitions and Systematics
- Solution of large-scale symmetric travelling salesman problems
- Stabilized column generation
- TSPLIB—A Traveling Salesman Problem Library
- The Cutting-Plane Method for Solving Convex Programs
- The Facility Location Problem with Limited Distances
- The Planar k-Means Problem is NP-Hard
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: Methods and applications
Cited in
(39)- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Mathematical optimization modelling for group counterfactual explanations
- Hydrological scenario reduction for stochastic optimization in hydrothermal power systems
- A review on declarative approaches for constrained clustering
- Designing algorithms for machine learning and data mining
- Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming
- Variable neighborhood search for harmonic means clustering
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- K-medoids inverse regression
- On strategies to fix degenerate \(k\)-means solutions
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Distance geometry and data science
- Semi-supervised \(k\)-means clustering via DC programming approach
- Robustification of the k-means clustering problem and tailored decomposition methods: when more conservative means more accurate
- Constrained clustering: current and new trends
- Optimization problems for machine learning: a survey
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- K-means clustering via a nonconvex optimization approach
- Integer programming in psychology: a review and directions for future research
- On clustering and interpreting with rules by means of mathematical optimization
- Constrained clustering by constraint programming
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- Column generation bounds for numerical microaggregation
- An exact algorithm for the two-mode \(KL\)-means partitioning problem
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- On the Weber facility location problem with limited distances and side constraints
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
- Augmentation search for integer programming over a polyhedron
- Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
- Location Problems with Cutoff
- A bisection method for solving distance-based clustering problems globally
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Constrained Clustering Using Column Generation
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- J-means and I-means for minimum sum-of-squares clustering on networks
This page was built for publication: An improved column generation algorithm for minimum sum-of-squares clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662300)
