Iterated maxima search for the maximally diverse grouping problem

DOI10.1016/j.ejor.2016.05.018zbMath1346.90786OpenAlexW2401626804MaRDI QIDQ323418

Jin-Kao Hao, Xiangjing Lai

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.018

zbMATH Keywords

heuristicsgraph grouping and clustering problemsiterated search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Heuristic search to the capacitated clustering 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 ⋮ The balanced maximally diverse grouping problem with integer attribute values ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ A hybrid heuristic for the maximum dispersion problem ⋮ Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping ⋮ The balanced maximally diverse grouping problem with block constraints ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values

Cites Work

• Unnamed Item
• Operational research in education
• Size-constrained graph partitioning polytopes
• Tabu search and GRASP for the maximum diversity problem
• Solving group technology problems via clique partitioning
• Constrained group balancing: why does it work
• A search space ``cartography for guiding graph coloring heuristics
• The node capacitated graph partitioning problem: A computational study
• Min-cut clustering
• A new adaptive multi-start technique for combinatorial global optimizations
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• An artificial bee colony algorithm for the maximally diverse grouping 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

This page was built for publication: Iterated maxima search for the maximally diverse grouping problem