A recursive Lagrangian method for clustering problems
From MaRDI portal
(Redirected from Publication:1111289)
Cites work
- A Branch and Bound Clustering Algorithm
- A Dynamic Programming Algorithm for Cluster Analysis
- A graph theoretic approach to the grouping of ordering data
- A Lagrangian treatment of certain nonlinear clustering problems
- A recursive Lagrangian method for clustering problems
- Cluster Analysis and Mathematical Programming
- Cluster analysis. A survey
- Cluster Analysis: An Application of Lagrangian Relaxation
- Conditional Clustering
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 3291711 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- On Some Clustering Techniques
- Optimal Sequential Partitions of Graphs
Cited in
(4)
This page was built for publication: A recursive Lagrangian method for clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111289)