A mixed-integer programming approach to the clustering problem with an application in customer segmentation (Q2497271): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3067756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a Branch and Bound Algorithm for Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and the Theory of Grouping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programming for Data Mining: Formulations and Challenges / rank
 
Normal rank
Property / cites work
 
Property / cites work: K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Grouping for Maximum Homogeneity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Clustering Algorithm / rank
 
Normal rank

Latest revision as of 18:27, 24 June 2024

scientific article
Language Label Description Also known as
English
A mixed-integer programming approach to the clustering problem with an application in customer segmentation
scientific article

    Statements

    Identifiers