An iterated greedy heuristic for a market segmentation problem with multiple attributes
From MaRDI portal
Publication:1753559
DOI10.1016/j.ejor.2017.02.013zbMath1403.90451OpenAlexW2588382121MaRDI QIDQ1753559
Rubén Ruiz, Diana L. Huerta-Muñoz, Roger Z. Ríos-Mercado
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.02.013
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Marketing, advertising (90B60)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- ROCK
- A model for clustering data from heterogeneous dissimilarities
- Iterated maxima search for the maximally diverse grouping problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Shifting representation search for hybrid flexible flowline problems
- NP-hardness of Euclidean sum-of-squares clustering
- Clusterwise linear regression
- A comparison of \(p\)-dispersion heuristics
- Greedy randomized adaptive search procedures
- Iterated greedy for the maximum diversity problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- -Means: A new generalized k-means clustering algorithm
- Note: A local-search heuristic for large set-covering problems
- A hybrid data mining metaheuristic for the p‐median problem
This page was built for publication: An iterated greedy heuristic for a market segmentation problem with multiple attributes
