An empirical comparison of heuristic methods for creating maximally diverse groups
From MaRDI portal
Publication:3157714
DOI10.1057/palgrave.jors.2600510zbMath1131.90365OpenAlexW1985771969MaRDI QIDQ3157714
No author found.
Publication date: 19 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600510
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Heuristic search to the capacitated clustering problem ⋮ Operational research in education ⋮ Iterated maxima search for the maximally diverse grouping problem ⋮ NP-hardness of \(m\)-dimensional weighted matching problems ⋮ Solving the clique partitioning problem as a maximally diverse grouping problem ⋮ Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS ⋮ A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem ⋮ Tabu search and GRASP for the capacitated clustering problem ⋮ Metaheuristic methods based on tabu search for assigning judges to competitions ⋮ K‐Plus anticlustering: An improved k‐means criterion for maximizing between‐group similarity ⋮ The table placement problem: a research challenge at the EWI 2007 ⋮ Approximation algorithms for bounded degree phylogenetic roots ⋮ Tabu search versus GRASP for the maximum diversity problem ⋮ Applications of the DM‐GRASP heuristic: a survey ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping ⋮ Construction and improvement algorithms for dispersion problems ⋮ The equitable dispersion problem ⋮ Approximation algorithms for the metric maximum clustering problem with given cluster sizes. ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
