Tabu search and GRASP for the maximum diversity problem
From MaRDI portal
(Redirected from Publication:857362)
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
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- A discrete optimization model for preserving biological diversity
- Computational aspects of the maximum diversity problem
- Greedy randomized adaptive search procedures
- 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
- Scatter search. Methodology and implementation in C. With CD-ROM.
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
- Solving the capacitated clustering problem with variable neighborhood search
- Measuring diversity. A review and an empirical analysis
- 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
- Heuristic solution approaches for the maximum minsum dispersion 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
- 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
- Formulations and valid inequalities for the capacitated dispersion problem
- GRASP and path relinking for the max-min diversity problem
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Construction and improvement algorithms for dispersion problems
- Experimental and Efficient Algorithms
- 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
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)
