A simple and effective algorithm for the MaxMin diversity problem
From MaRDI portal
Recommendations
Cites work
- A fast algorithm for the maximum clique problem
- A heuristic approach for the max-min diversity problem based on max-clique
- Applications of the DM‐GRASP heuristic: a survey
- Computational aspects of the maximum diversity problem
- Experimental and Efficient Algorithms
- Good solutions to discrete noxious location problems via metaheuristics
- GRASP and path relinking for the max-min diversity problem
- Heuristic algorithms for the maximum diversity problem
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Hybrid heuristics for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Tabu search and GRASP for the maximum diversity problem
- Tabu search versus GRASP for the maximum diversity problem
- The discrete p-dispersion problem
Cited in
(23)- A heuristic approach for the max-min diversity problem based on max-clique
- GRASP and path relinking for the max-min diversity problem
- Computational aspects of the maximum diversity problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- A new compact formulation for the discrete p-dispersion problem
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Measuring diversity. A review and an empirical analysis
- Maximum diversity problem with squared Euclidean distance
- t-linearization for the maximum diversity problem
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
- A hybrid metaheuristic method for the maximum diversity problem
- A branch and bound algorithm for the maximum diversity problem
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- Tabu search guided by reinforcement learning for the max-mean dispersion problem
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- A review on discrete diversity and dispersion maximization from an OR perspective
- Optimal results and tight bounds for the Maximum Diversity Problem
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- An improved analysis of local search for max-sum diversification
- On solving simplified diversified top-k\,s-plex problem
- D<scp>iversi</scp>T<scp>ree</scp>: A New Method to Efficiently Compute Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization Problems
- Construction and improvement algorithms for dispersion problems
This page was built for publication: A simple and effective algorithm for the MaxMin diversity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646655)
