Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
From MaRDI portal
Publication:2029286
DOI10.1016/j.ejor.2020.07.048zbMath1487.90649OpenAlexW3046190147MaRDI QIDQ2029286
Dong Yue, Zhang-Hua Fu, Xiangjing Lai, Jin-Kao Hao
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
Related Items (5)
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem ⋮ The balanced maximally diverse grouping problem with attribute values ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A three-phased local search approach for the clique partitioning problem
- Operational research in education
- Iterated maxima search for the maximally diverse grouping problem
- Constrained group balancing: why does it work
- A cutting plane algorithm for a clustering problem
- An artificial bee colony algorithm for the maximally diverse grouping problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Variable neighborhood search for maximum diverse grouping problem
- An empirical comparison of heuristic methods for creating maximally diverse groups
- A class of bounded approximation algorithms for graph partitioning
- Variable neighborhood search: Principles and applications
This page was built for publication: Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
