Tabu search and GRASP for the maximum diversity problem
From MaRDI portal
Publication:857362
DOI10.1016/J.EJOR.2006.01.021zbMATH Open1109.90081OpenAlexW2009273111MaRDI QIDQ857362FDOQ857362
Authors: Abraham Duarte, Rafael Martí 
Publication date: 14 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.021
Recommendations
- Tabu search versus GRASP for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- Diversification strategies in tabu search algorithms for the maximum clique problem
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- Hybrid heuristics for the maximum diversity problem
- A hybrid metaheuristic method for the maximum diversity problem
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A branch and bound algorithm for the maximum diversity problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Computational aspects of the maximum diversity problem
- A discrete optimization model for preserving biological diversity
- Heuristic algorithms for the maximum diversity problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
Cited In (41)
- Iterated greedy for the maximum diversity problem
- A branch and bound algorithm for the maximum diversity problem
- Discrete Diversity and Dispersion Maximization
- VNS variants for the Max-Mean dispersion problem
- Iterated tabu search for the maximum diversity problem
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- \(t\)-linearization for the maximum diversity problem
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Hybrid heuristics for the maximum diversity problem
- Heuristic search to the capacitated clustering problem
- Measuring diversity. A review and an empirical analysis
- Solving the capacitated clustering problem with variable neighborhood search
- A two-stage method for member selection of emergency medical service
- Multiple-path selection for new highway alignments using discrete algorithms
- Iterated maxima search for the maximally diverse grouping problem
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- The maximum diversity assortment selection problem
- Black box scatter search for general classes of binary optimization problems
- GRASP and path relinking for the equitable dispersion problem
- Heuristics for the bi-objective path dissimilarity problem
- Tabu search guided by reinforcement learning for the max-mean dispersion problem
- A review on discrete diversity and dispersion maximization from an OR perspective
- Heuristic solution approaches for the maximum minsum dispersion problem
- Formulations and valid inequalities for the capacitated dispersion problem
- A simple and effective algorithm for the MaxMin diversity problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- A heuristic approach for the max-min diversity problem based on max-clique
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- GRASP and path relinking for the max-min diversity problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Experimental and Efficient Algorithms
- Construction and improvement algorithms for dispersion problems
- Tabu search versus GRASP for the maximum diversity problem
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- A hybrid metaheuristic method for the maximum diversity problem
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
- Approaching the rank aggregation problem by local search-based metaheuristics
- Heuristics for the capacitated dispersion problem
- Scatter search for the bandpass problem
Uses Software
This page was built for publication: Tabu search and GRASP for the maximum diversity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857362)
