120
Views
18
CrossRef citations to date
0
Altmetric
General Paper

Maximally diverse grouping: an iterated tabu search approach

, &
Pages 579-592 | Received 29 Aug 2012, Accepted 17 Feb 2014, Published online: 21 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Rubens Correia, Anand Subramanian, Teobaldo Bulhões & Puca Huachi V. Penna. (2022) Scheduling the Brazilian OR conference. Journal of the Operational Research Society 73:7, pages 1487-1498.
Read now

Articles from other publishers (17)

L. Senbagamalar & S. Logeswari. (2024) Genetic Clustering Algorithm-Based Feature Selection and Divergent Random Forest for Multiclass Cancer Classification Using Gene Expression Data. International Journal of Computational Intelligence Systems 17:1.
Crossref
Alessandro Hill & Steffen Peuker. (2023) Expanding students’ social networks via optimized team assignments. Annals of Operations Research 332:1-3, pages 1107-1131.
Crossref
Arne Schulz. (2023) The balanced maximally diverse grouping problem with attribute values. Discrete Applied Mathematics 335, pages 82-103.
Crossref
Xiao Yang, Zonghui Cai, Ting Jin, Zheng Tang & Shangce Gao. (2022) A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem. European Journal of Operational Research 302:3, pages 925-953.
Crossref
Arne Schulz. (2022) A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values. Annals of Operations Research 318:1, pages 501-530.
Crossref
Gintaras Palubeckis. (2022) Metaheuristic approaches for ratio cut and normalized cut graph partitioning. Memetic Computing 14:3, pages 253-285.
Crossref
Yaoyao Liu, Ping Guo & Yi Zeng. (2022) HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem. Computational Intelligence and Neuroscience 2022, pages 1-24.
Crossref
Irit Talmor. (2022) Maximizing diversity within and among teams in a large-scale project. MethodsX 9, pages 101908.
Crossref
Arne Schulz. (2021) The balanced maximally diverse grouping problem with block constraints. European Journal of Operational Research 294:1, pages 42-53.
Crossref
Xiangjing Lai, Jin-Kao Hao, Zhang-Hua Fu & Dong Yue. (2021) Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping. European Journal of Operational Research 289:3, pages 1067-1086.
Crossref
Kavita Singh & Shyam Sundar. (2019) A new hybrid genetic algorithm for the maximally diverse grouping problem. International Journal of Machine Learning and Cybernetics 10:10, pages 2921-2940.
Crossref
Zhiqiang Zhang, Zhongwen Li, Xiaobing Qiao & Weijun Wang. (2019) An Efficient Memetic Algorithm for the Minimum Load Coloring Problem. Mathematics 7:5, pages 475.
Crossref
Pragathi Praveena, Daniel Rakita, Bilge Mutlu & Michael Gleicher. (2019) User-Guided Offline Synthesis of Robot Arm Motion from 6-DoF Paths. User-Guided Offline Synthesis of Robot Arm Motion from 6-DoF Paths.
Qing Zhou, Una Benlic, Qinghua Wu & Jin-Kao Hao. (2019) Heuristic search to the capacitated clustering problem. European Journal of Operational Research 273:2, pages 464-487.
Crossref
Fuda Ma, Jin-Kao Hao & Yang Wang. (2017) An effective iterated tabu search for the maximum bisection problem. Computers & Operations Research 81, pages 78-89.
Crossref
Xiangjing Lai & Jin-Kao Hao. (2016) Iterated variable neighborhood search for the capacitated clustering problem. Engineering Applications of Artificial Intelligence 56, pages 102-120.
Crossref
Xiangjing Lai & Jin-Kao Hao. (2016) Iterated maxima search for the maximally diverse grouping problem. European Journal of Operational Research 254:3, pages 780-800.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.