Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
From MaRDI portal
Publication:2029286
DOI10.1016/J.EJOR.2020.07.048zbMATH Open1487.90649OpenAlexW3046190147MaRDI QIDQ2029286FDOQ2029286
Authors: Xiangjing Lai, Jin-Kao Hao, Zhanghua Fu, Dong Yue 
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.048
Recommendations
- Iterated maxima search for the maximally diverse grouping problem
- Variable neighborhood search for maximum diverse grouping problem
- A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem
- Tabu search and GRASP for the maximum diversity problem
- Solving the clique partitioning problem as a maximally diverse grouping problem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Variable neighborhood search: Principles and applications
- A cutting plane algorithm for a clustering problem
- A three-phased local search approach for the clique partitioning problem
- An empirical comparison of heuristic methods for creating maximally diverse groups
- Operational research in education
- An artificial bee colony algorithm for the maximally diverse grouping problem
- Variable neighborhood search for maximum diverse grouping problem
- Iterated maxima search for the maximally diverse grouping problem
- A class of bounded approximation algorithms for graph partitioning
- Constrained group balancing: why does it work
Cited In (10)
- Using group theory and transition matrices to study a class of metaheuristic neighborhoods
- Variable neighborhood search for maximum diverse grouping problem
- The balanced maximally diverse grouping problem with attribute values
- Iterated maxima search for the maximally diverse grouping problem
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- Solving the clique partitioning problem as a maximally diverse grouping problem
- Efficient neighborhood evaluation for the maximally diverse grouping problem
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
- A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem
- A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
Uses Software
This page was built for publication: Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029286)
