Memetic self-adaptive evolution strategies applied to the maximum diversity problem
From MaRDI portal
Publication:2448149
DOI10.1007/s11590-013-0610-0zbMath1294.90036OpenAlexW2069654780MaRDI QIDQ2448149
Rodrigo Cesar Silva, Alan Robert Resende De Freitas, Frederico Gadelha Guimarães, Marcone Jamilson Freitas Souza
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0610-0
metaheuristicsevolutionary algorithmsmaximum diversity problemmemetic self-adaptive evolution strategies
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items (2)
A review on discrete diversity and dispersion maximization from an OR perspective ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
Uses Software
Cites Work
- Unnamed Item
- Tabu search and GRASP for the maximum diversity problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- GRASP and path relinking for the max-min diversity problem
- Computational aspects of the maximum diversity problem
- Iterated greedy for the maximum diversity problem
- A branch and bound algorithm for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- First vs. best improvement: an empirical study
- Heuristic algorithms for the maximum diversity problem
This page was built for publication: Memetic self-adaptive evolution strategies applied to the maximum diversity problem