Design of balanced MBA student teams
From MaRDI portal
Recommendations
Cited in
(17)- Variable neighbourhood search: Methods and applications
- Solving the clique partitioning problem as a maximally diverse grouping problem
- The balanced maximally diverse grouping problem with block constraints
- NP-hardness of \(m\)-dimensional weighted matching problems
- Using patterns to form homogeneous teams
- A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem
- A balanced team-generating model for teams with less than nine persons
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
- The table placement problem: a research challenge at the EWI 2007
- scientific article; zbMATH DE number 2144387 (Why is no real title available?)
- Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- Strategic oscillation for the balanced minimum sum-of-squares clustering problem
- Feasible and infeasible region search for the maximally diverse grouping problem
- A balanced team generating model
- Variable neighbourhood search: methods and applications
- Constrained group balancing: why does it work
This page was built for publication: Design of balanced MBA student teams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4671549)
