Hybrid heuristics for the maximum diversity problem

DOI10.1007/s10589-007-9161-6zbMath1181.90196OpenAlexW2089327800MaRDI QIDQ2655404

Rafael Martí, Micael Gallego, Abraham Duarte, Manuel Laguna

Publication date: 25 January 2010

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9161-6

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items

A review on algorithms for maximum clique problems, VNS variants for the Max-Mean dispersion 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 discrete diversity and dispersion maximization from an OR perspective, Tabu search and GRASP for the capacitated clustering problem, A two-phase tabu search based evolutionary algorithm for the maximum diversity problem, Heuristics for the capacitated dispersion problem, Formulations and valid inequalities for the capacitated dispersion problem, A simple and effective algorithm for the MaxMin diversity problem, Heuristic solution approaches for the maximum minsum dispersion problem, Scatter search for the bandpass problem, A nonconvex quadratic optimization approach to the maximum edge weight clique problem, Black box scatter search for general classes of binary optimization problems, Measuring diversity. A review and an empirical analysis, Construction and improvement algorithms for dispersion problems, The maximum diversity assortment selection problem, A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem, Variable neighborhood search for the heaviest \(k\)-subgraph, A hybrid metaheuristic method for the maximum diversity problem

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Tabu search and GRASP for the maximum diversity problem
• Computational aspects of the maximum diversity problem
• An experimental evaluation of a scatter search for the linear ordering problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Experimental testing of advanced scatter search designs for global optimization of multimodal functions
• Heuristic algorithms for the maximum diversity problem