Pages that link to "Item:Q3157714"
From MaRDI portal
The following pages link to An empirical comparison of heuristic methods for creating maximally diverse groups (Q3157714):
Displaying 24 items.
- Operational research in education (Q319179) (← links)
- Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
- The table placement problem: a research challenge at the EWI 2007 (Q458951) (← links)
- Metaheuristic methods based on tabu search for assigning judges to competitions (Q613764) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
- Approximation algorithms for bounded degree phylogenetic roots (Q926287) (← links)
- Tabu search versus GRASP for the maximum diversity problem (Q926570) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Heuristic search to the capacitated clustering problem (Q1622798) (← links)
- Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
- A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values (Q2095925) (← links)
- NP-hardness of \(m\)-dimensional weighted matching problems (Q2166755) (← links)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
- A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem (Q2672118) (← links)
- Maximum diversity/similarity models with extension to part grouping (Q3025047) (← links)
- Applications of the DM‐GRASP heuristic: a survey (Q3546241) (← links)
- Assigning pupils to tutor groups in a comprehensive school (Q4658448) (← links)
- K‐Plus anticlustering: An improved <i>k</i>‐means criterion for maximizing between‐group similarity (Q6127072) (← links)
- Expanding students' social networks via optimized team assignments (Q6596993) (← links)
- Efficient neighborhood evaluation for the maximally diverse grouping problem (Q6644387) (← links)