Hybrid heuristics for the maximum diversity problem
From MaRDI portal
Publication:2655404
Recommendations
- Heuristic algorithms for the maximum diversity problem
- A hybrid metaheuristic method for the maximum diversity problem
- A branch and bound algorithm for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- Tabu search and GRASP for the maximum diversity problem
- A hybrid heuristic for the maximum dispersion problem
- A heuristic approach for the max-min diversity problem based on max-clique
- Computational aspects of the maximum diversity problem
Cites work
- An experimental evaluation of a scatter search for the linear ordering problem
- Computational aspects of the maximum diversity problem
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Heuristic algorithms for the maximum diversity problem
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Tabu search and GRASP for the maximum diversity problem
Cited in
(27)- Variable neighborhood search for the heaviest \(k\)-subgraph
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- Diversification strategies in tabu search algorithms for the maximum clique problem
- A hybrid heuristic for the maximum dispersion problem
- Measuring diversity. A review and an empirical analysis
- The maximum diversity assortment selection 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
- An exact semidefinite programming approach for the max-mean dispersion problem
- A review on algorithms for maximum clique problems
- VNS variants for the Max-Mean dispersion problem
- 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
- An empirical comparison of heuristic methods for creating maximally diverse groups
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- Heuristic solution approaches for the maximum minsum dispersion problem
- Scatter search for the bandpass problem
- Heuristics for the capacitated dispersion problem
- Discrete Diversity and Dispersion Maximization
- Formulations and valid inequalities for the capacitated dispersion problem
- A simple and effective algorithm for the MaxMin diversity problem
- Construction and improvement algorithms for dispersion problems
- Solving huge size instances of the optimal diversity management problem
- Tabu search and GRASP for the maximum diversity problem
- Tabu search and GRASP for the capacitated clustering problem
- Black box scatter search for general classes of binary optimization problems
This page was built for publication: Hybrid heuristics for the maximum diversity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655404)
