Metaheuristic search algorithms in solving the n-similarity problem
From MaRDI portal
Publication:4595591
DOI10.3233/FI-2017-1516zbMATH Open1375.68104OpenAlexW2604917485MaRDI QIDQ4595591FDOQ4595591
Authors: Mina Mirhosseini, Hossein Nezamabadi-Pour
Publication date: 5 December 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2017-1516
Recommendations
- Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems
- Metaheuristic optimization: nature-inspired algorithms and applications
- scientific article; zbMATH DE number 5308434
- Optimization of fuzzy clustering criteria by a hybrid PSO and fuzzy \(c\)-means clustering algorithm
- Firefly Algorithms for Multimodal Optimization
particle swarm optimizationgravitational search algorithmimperialist competition algorithm\(n\)-similarityfuzzy imperialist competition algorithmtext document similarity
Cited In (2)
This page was built for publication: Metaheuristic search algorithms in solving the \(n\)-similarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595591)