Genetic clustering algorithms.
From MaRDI portal
Recommendations
Cites work
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Dynamic Programming Algorithm for Cluster Analysis
- A network relaxation based enumeration algorithm for set partitioning
- A set partitioning heuristic for the generalized assignment problem
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Circuit Partitioning Via Set Partitioning and Column Generation
- Cluster Analysis: An Application of Lagrangian Relaxation
- Genetic learning of dynamic scheduling within a simulation environment
- Genetic search and the dynamic facility layout problem
- Graph theoretic relaxations of set covering and set partitioning problems
- scientific article; zbMATH DE number 3672307 (Why is no real title available?)
- scientific article; zbMATH DE number 40470 (Why is no real title available?)
- scientific article; zbMATH DE number 40987 (Why is no real title available?)
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- scientific article; zbMATH DE number 1140603 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Minimum sum of diameters clustering
- Set partition by globally optimized cluster seed points
- The Set-Covering Problem: A New Implicit Enumeration Algorithm
Cited in
(23)- A Lagrangian search method for the \(P\)-median problem
- A genetic algorithm approach to cluster analysis.
- The capacitated centred clustering problem
- scientific article; zbMATH DE number 1799467 (Why is no real title available?)
- Large-scale pickup and delivery work area design
- scientific article; zbMATH DE number 5117364 (Why is no real title available?)
- Genetic operators for hierarchical graph clustering
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Clustering multivariate time series by genetic multiobjective optimization
- An effective heuristic for the \(P\)-median problem with application to ambulance location
- The effective BRKGA algorithm for the k-medoids clustering problem
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
- New genetic algorithm with greedy heuristic for clustering problems with unknown number of groups
- A reactive GRASP with path relinking for capacitated clustering
- An adaptive genetic clustering method for exploratory mining of feature vector and time series data
- Genetic clustering for data mining
- An approach based on genetic algorithms for clustering classes in components
- A genetic approach to the automatic clustering problem
- An optimising approach to alternative clustering schemes
- Median based conversion of SGPA into percentage by cognitive methods
- Clustering financial time series: an application to mutual funds style analysis
- Differential evolution and particle swarm optimisation in partitional clustering
- Validating vehicle routing zone construction using Monte Carlo simulation
This page was built for publication: Genetic clustering algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952444)
