A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
From MaRDI portal
Publication:2095925
DOI10.1007/s10479-022-04707-2OpenAlexW4280551236MaRDI QIDQ2095925
Publication date: 15 November 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-04707-2
Related Items (2)
The balanced maximally diverse grouping problem with attribute values ⋮ The balanced maximally diverse grouping problem with integer attribute values
Cites Work
- Operational research in education
- Iterated maxima search for the maximally diverse grouping problem
- Preference-based assignment of university students to multiple teaching groups
- Construction and improvement algorithms for dispersion problems
- Constrained group balancing: why does it work
- Operating room planning and scheduling: a literature review
- A cutting plane algorithm for a clustering problem
- Solving the clique partitioning problem as a maximally diverse grouping problem
- 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
- The balanced maximally diverse grouping problem with block constraints
- An artificial bee colony algorithm for the maximally diverse grouping problem
- An empirical comparison of heuristic methods for creating maximally diverse groups
- A class of bounded approximation algorithms for graph partitioning
- Assigning pupils to tutor groups in a comprehensive school
This page was built for publication: A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
