Cluster generation and grouping using mathematical programming
From MaRDI portal
(Redirected from Cluster generation and grouping using mathematical programming)
Cites work
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- A molecular sequence metric and evolutionary trees
- An Algorithm for Euclidean Sum of Squares Classification
- An Analysis of Some Graph Theoretical Cluster Techniques
- An efficient algorithm for minimumk-covers in weighted graphs
- Cluster Analysis and Mathematical Programming
- scientific article; zbMATH DE number 3480381 (Why is no real title available?)
- scientific article; zbMATH DE number 3480512 (Why is no real title available?)
- scientific article; zbMATH DE number 3485516 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3543855 (Why is no real title available?)
- scientific article; zbMATH DE number 3574781 (Why is no real title available?)
- scientific article; zbMATH DE number 3347515 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- Integer Programming and the Theory of Grouping
- Linear multiple objective programs with zero–one variables
- Multiple criteria decision making, 22nd International Meeting of TIMS, July 24--26, 1975, Kyoto/Japan
- On Grouping for Maximum Homogeneity
This page was built for publication: Cluster generation and grouping using mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255741)