Algorithms for the q-model clustering problem with application in switching cabinet manufacturing
From MaRDI portal
Publication:2482776
Recommendations
- Clustering model and algorithm for production inventory and distribution problem
- Clustering problems in optimization models
- scientific article; zbMATH DE number 4189544
- Optimization models and algorithms for the hyperplane clustering problem
- 10.1007/s11470-008-1013-7
- Clustering methods for printed circuit board insertion problems
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
Cites work
- An Efficient Heuristic Procedure for Partitioning Graphs
- c-means clustering with the l/sub l/ and l/sub infinity / norms
- Cluster Analysis and Mathematical Programming
- Cluster Analysis: An Application of Lagrangian Relaxation
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 1348600 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Mathematical classification and clustering
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
This page was built for publication: Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482776)