References
- AraniTLotfiVA three phased approach to final exam schedulingIIE Transactions1989211869610.1080/07408178908966211
- BakerKRPowellSGMethods for assigning students to groups: A study of alternative objective functionsJournal of the Operational Research Society200253439740410.1057/palgrave.jors.2601307
- BhaduryJMightyEJDamarHMaximizing workforce diversity in project teams: A network flow approachOmega200028214315310.1016/S0305-0483(99)00037-7
- Chen CC (1986). Placement and partitioning methods for integrated circuit layout. PhD Dissertation, EECS Department, University of California, Berkeley.
- ChenYFanZPMaJZengSA hybrid grouping genetic algorithm for reviewer group construction problemExpert Systems with Applications20113832401241110.1016/j.eswa.2010.08.029
- DuarteAMartíRTabu search and GRASP for the maximum diversity problemEuropean Journal of Operational Research20071781718410.1016/j.ejor.2006.01.021
- FalkenauerEGenetic Algorithms for Grouping Problems1998
- FanZPChenYMaJZengSA hybrid genetic algorithmic approach to the maximally diverse grouping problemJournal of the Operational Research Society2011621929910.1057/jors.2009.168
- FeoTKhellafMA class of bounded approximation algorithms for graph partitioningNetworks199020218119510.1002/net.3230200205
- FeoTGoldschmidtOKhellafMOne-half approximation algorithms for the k-partition problemOperations Research199240Supplement 1S170S17310.1287/opre.40.1.S170
- GallegoMDuarteALagunaMMartíRHybrid heuristics for the maximum diversity problemJournal of Computational Optimization and Application200944341142610.1007/s10589-007-9161-6
- GloverFLagunaMTabu Search1997
- GloverFKuoCCDhirKSHeuristic algorithms for the maximum diversity problemJournal of Information and Optimization Sciences199819110913210.1080/02522667.1998.10699366
- HettichSPazzaniMJMining for element reviewers: Lessons learned at the national science foundationProceedings of the KDD’062006862871
- KralJTo the problem of segmentation of a programInformation Processing Machines196521116127
- LotfiVCervenyRA final-exam-scheduling packageJournal of the Operational Research Society199142320521610.1057/jors.1991.42
- Martí R and Sandoya F (2012). GRASP and path relinking for the equitable dispersion problem. Computers and Operations Research, In press, http://dx.doi.org/10.1016/j.cor.2012.04.005.
- Martí R, Gallego M and Duarte A (2012). Heuristics and metaheuristics for the maximum diversity problem. Journal of Heuristics, doi: 10.1007/s10732-011-9172-4.
- MillerJPotterWGandhamRLapenaCAn evaluation of local improvement operators for genetic algorithmsIEEE Transactions on Systems, Man and Cybernetics19932351340135110.1109/21.260665
- MingersJO'BrienFACreating students groups with similar characteristics: A heuristic approachOmega199523331332110.1016/0305-0483(95)00014-F
- O'Brien FA and Mingers J (1995). The equitable partitioning problem: A heuristic algorithm applied to the allocation of university student accommodation. Warwick Business School, Research Paper no. 187.
- ResendeMGCMartíRGallegoMDuarteAGRASP and path relinking for the max-min diversity problemComputers and Operations Research201037349850810.1016/j.cor.2008.05.011
- RibeiroCCUchoaEWerneckRFA hybrid GRASP with perturbations for the Steiner problem in graphsINFORMS Journal on Computing200214322824610.1287/ijoc.14.3.228.116
- VaskoFJKnollePJSpiegelDSAn empirical study of hybrid genetic algorithms for the set covering problemThe Journal of the Operational Research Society200556101213122310.1057/palgrave.jors.2601919
- WeitzRRJelassiMTAssigning students to groups: A multi-criteria decision support system approachDecision Sciences199223374675710.1111/j.1540-5915.1992.tb00415.x
- WeitzRRLakshminarayananSOn a heuristic for the final exam scheduling problemJournal of the Operational Research Society199647459960010.1057/jors.1996.72
- WeitzRRLakshminarayananSAn empirical comparison of heuristic methods for creating maximally diverse groupsJournal of the Operational Research Society199849663564610.1057/palgrave.jors.2600510