A tabu search based memetic algorithm for the maximum diversity problem-Reference-Cited by-同舟云学术

A tabu search based memetic algorithm for the maximum diversity problem

Published:2014-01 Issue: Volume:27 Page:103-114
ISSN:0952-1976
Container-title:Engineering Applications of Artificial Intelligence
language:en
Short-container-title:Engineering Applications of Artificial Intelligence

Author:

Wang Yang,Hao Jin-Kao,Glover Fred,Lü Zhipeng

Funder

the Pays de la Loire Region (France)

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Artificial Intelligence,Control and Systems Engineering

Reference30 articles.

1. Andrade, P.M.F., Plastino, A., Ochi, L.S., Martins, S.L., 2003. GRASP for the maximum diversity problem. In: Proceedings of the Fifth Metaheuristics International Conference (MIC2003), Paper 15.

2. Grasp with path-relinking for the maximum diversity problem;Andrade,2005

3. Optimal results and tight bounds for the maximum diversity problem;Aringhieri;Foundations of Computing and Decision Sciences,2009

4. Tabu search versus GRASP for the maximum diversity problem;Aringhieri;4 OR: A Quarterly Journal of Operations Research,2008

5. Comparing local search metaheuristics for the maximum diversity problem;Aringhieri;Journal of the Operational Research Society,2011

Cited by 42 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Forward–Backward Simheuristic for the Stochastic Capacitated Dispersion Problem;Mathematics;2024-03-20

2. On the benefits of a new continuous reformulation for QUBO problems;Annals of Operations Research;2024-03-04

3. A method for the systematic selection of enzyme panel candidates by solving the maximum diversity problem;Biosystems;2024-02

4. A geometric framework for multiclass ensemble classifiers;Machine Learning;2023-09-27

5. Solution-based tabu search for the capacitated dispersion problem;Expert Systems with Applications;2023-08