DILS: constrained clustering through dual iterative local search
DOI10.1016/j.cor.2020.104979zbMath1458.68202OpenAlexW3020413602MaRDI QIDQ2664309
Germán González-Almagro, Salvador Garcia, Julián Luengo, José Ramón Cano
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104979
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Applications of stochastic analysis (to PDEs, etc.) (60H30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- CECM: constrained evidential \(C\)-means algorithm
- An iterated local search for the traveling salesman problem with release dates and completion time minimization
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems
- ECM: An evidential version of the fuzzy \(c\)-means algorithm
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Semi-Supervised Deep Learning Using Pseudo Labels for Hyperspectral Image Classification
- Structural, Syntactic, and Statistical Pattern Recognition
- Handbook of metaheuristics
- Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
This page was built for publication: DILS: constrained clustering through dual iterative local search