Constrained group balancing: why does it work
From MaRDI portal
Recommendations
- The balanced maximally diverse grouping problem with block constraints
- Clustering with balancing constraints
- Constrained group choice
- Load balancing: An exercise in constrained convergence
- The balanced maximally diverse grouping problem with attribute values
- Distributed Balancing With Constrained Integer Weights
- The balanced maximally diverse grouping problem with integer attribute values
- On the role of the group composition for achieving optimality
Cites work
Cited in
(14)- Feasible and infeasible region search for 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 integer attribute values
- Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search
- SPREAD: A Balancing Constraint Based on Statistics
- Design of balanced MBA student teams
- A balanced team generating model
- The balanced maximally diverse grouping problem with attribute values and varying group sizes
- The balanced maximally diverse grouping problem with block constraints
- scientific article; zbMATH DE number 2144387 (Why is no real title available?)
- 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
- A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
This page was built for publication: Constrained group balancing: why does it work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976414)