Genetic clustering algorithms.
From MaRDI portal
Publication:5952444
DOI10.1016/S0377-2217(00)00320-9zbMath1051.90527MaRDI QIDQ5952444
Yu-Chiun Chiou, Lawrence W. Lan
Publication date: 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (12)
Large-scale pickup and delivery work area design ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ An optimising approach to alternative clustering schemes ⋮ Clustering multivariate time series by genetic multiobjective optimization ⋮ An effective heuristic for the \(P\)-median problem with application to ambulance location ⋮ Clustering financial time series: an application to mutual funds style analysis ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ Differential evolution and particle swarm optimisation in partitional clustering ⋮ A reactive GRASP with path relinking for capacitated clustering ⋮ Validating vehicle routing zone construction using Monte Carlo simulation ⋮ An adaptive genetic clustering method for exploratory mining of feature vector and time series data ⋮ The capacitated centred clustering problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum sum of diameters clustering
- Set partition by globally optimized cluster seed points
- A network relaxation based enumeration algorithm for set partitioning
- A set partitioning heuristic for the generalized assignment problem
- 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
- Cluster Analysis: An Application of Lagrangian Relaxation
- Algorithmic complexity: threeNP- hard problems in computational statistics
- The Set-Covering Problem: A New Implicit Enumeration Algorithm
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Circuit Partitioning Via Set Partitioning and Column Generation
- A Dynamic Programming Algorithm for Cluster Analysis
This page was built for publication: Genetic clustering algorithms.
