Design of balanced MBA student teams

DOI10.1057/palgrave.jors.2601775zbMath1122.91368OpenAlexW2163940244MaRDI QIDQ4671549

Daniel Villeneuve, Nenad Mladenović, Jacques Desrosiers

Publication date: 26 April 2005

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601775

zbMATH Keywords

clusteringmetaheuristicsset partitioningvariable neighbourhood search

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20)

Related Items (11)

NP-hardness of \(m\)-dimensional weighted matching problems ⋮ Solving the clique partitioning problem as a maximally diverse grouping problem ⋮ A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem ⋮ Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering ⋮ Strategic oscillation for the balanced minimum sum-of-squares clustering problem ⋮ The table placement problem: a research challenge at the EWI 2007 ⋮ Variable neighbourhood search: methods and applications ⋮ Constrained group balancing: why does it work ⋮ Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems ⋮ Variable neighbourhood search: Methods and applications ⋮ Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search

This page was built for publication: Design of balanced MBA student teams