A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem (Q2672118): Difference between revisions

@@ Property / describes a project that uses @@
+TPSDP
@@ Property / describes a project that uses: TPSDP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2022.02.003
+Normal rank
@@ Property / OpenAlex ID @@
+W4210521040
@@ Property / OpenAlex ID: W4210521040 / rank @@
+Normal rank
@@ Property / cites work @@
+Design of balanced MBA student teams
@@ Property / cites work: Design of balanced MBA student teams / rank @@
+Normal rank
@@ Property / cites work @@
+A class of bounded approximation algorithms for graph partitioning
+Normal rank
@@ Property / cites work @@
+Operational research in education
@@ Property / cites work: Operational research in education / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained group balancing: why does it work
@@ Property / cites work: Constrained group balancing: why does it work / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated maxima search for the maximally diverse grouping problem
+Normal rank
@@ Property / cites work @@
+Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
+Normal rank
@@ Property / cites work @@
+An artificial bee colony algorithm for the maximally diverse grouping problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for maximum diverse grouping problem
+Normal rank
@@ Property / cites work @@
+An empirical comparison of heuristic methods for creating maximally diverse groups
+Normal rank