Constrained group balancing: why does it work
From MaRDI portal
Publication:976414
DOI10.1016/j.ejor.2010.02.011zbMath1188.90286OpenAlexW2049343437MaRDI QIDQ976414
Anton Ovchinnikov, Dmitry Krass
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.011
Related Items (7)
Iterated maxima search for the maximally diverse grouping problem ⋮ 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 ⋮ 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 ⋮ Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search
Cites Work
This page was built for publication: Constrained group balancing: why does it work