A mixed-integer programming approach to the clustering problem with an application in customer segmentation
DOI10.1016/J.EJOR.2005.04.048zbMATH Open1131.90434OpenAlexW2172073367MaRDI QIDQ2497271FDOQ2497271
Authors: Burcu Sağlam, F. Sibel Salman, Serpil Sayın, Metin Türkay 
Publication date: 4 August 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.048
Recommendations
- A novel mixed integer linear programming model for clustering relational networks
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- scientific article; zbMATH DE number 4007495
- A global optimization RLT-based approach for solving the hard clustering problem
- Integer programming models for the \(q\)-mode problem
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Mixed integer programming (90C11)
Cites Work
- Cluster analysis.
- On Grouping for Maximum Homogeneity
- Integer Programming and the Theory of Grouping
- Cluster Analysis and Mathematical Programming
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Mathematical Programming for Data Mining: Formulations and Challenges
- A Branch and Bound Clustering Algorithm
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
- Evaluation of a Branch and Bound Algorithm for Clustering
Cited In (17)
- On mathematical optimization for clustering categories in contingency tables
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Segmentation of scanning-transmission electron microscopy images using the ordered median problem
- Market segmentation by maximum likelihood clustering using choice elasticities.
- A novel mixed integer linear programming model for clustering relational networks
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Identifying Fixations in Gaze Data via Inner Density and Optimization
- The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects
- Optimization problems for machine learning: a survey
- Size-constrained graph partitioning polytopes
- Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- Synergies of operations research and data mining
- A mathematical programming based procedure for breast cancer classification
- Synergies between operations research and data mining: the emerging use of multi-objective approaches
- A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping
- Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem
Uses Software
This page was built for publication: A mixed-integer programming approach to the clustering problem with an application in customer segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497271)
