Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
From MaRDI portal
Publication:2029286
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
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- A class of bounded approximation algorithms for graph partitioning
- A cutting plane algorithm for a clustering problem
- A three-phased local search approach for the clique partitioning problem
- An artificial bee colony algorithm for the maximally diverse grouping problem
- An empirical comparison of heuristic methods for creating maximally diverse groups
- Constrained group balancing: why does it work
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Iterated maxima search for the maximally diverse grouping problem
- Operational research in education
- Variable neighborhood search for maximum diverse grouping problem
- Variable neighborhood search: Principles and applications
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
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
- Efficient neighborhood evaluation for the maximally diverse grouping 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
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)
