A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
DOI10.1016/j.disopt.2020.100613OpenAlexW3093839249MaRDI QIDQ2673240
Jiaming Chen, Zhouxing Su, Xiaolu Liu, Zhipeng Lü, Yang Wang, Ming-hui Wang
Publication date: 9 June 2022
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2020.100613
tabu searchpath relinkinghybrid evolutionary algorithmrecombination operatormaximum diversity problemdynamic candidate list
Integer programming (90C10) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid metaheuristic approach to solving the UBQP problem
- Tabu search and GRASP for the maximum diversity problem
- Tabu search versus GRASP for the maximum diversity problem
- The equitable dispersion problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Computational aspects of the maximum diversity problem
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Partition-distance: A problem and class of perfect graphs arising in clustering
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- Iterated greedy 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
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- Hybrid heuristics for the maximum diversity problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- Heuristic algorithms for the maximum diversity problem
- The dense \(k\)-subgraph problem
This page was built for publication: A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
