References
- AraniTLotfiVA three phased approach to final exam schedulingIIE Transactions1989211869610.1080/07408178908966211
- AreibiSGrewalGBanerjiDDuPHierarchical FPGA placementCanadian Journal of Electrical and Computer Engineering2007321536410.1109/CJECE.2007.364333
- AringhieriRCordoneRComparing local search metaheuristics for the maximum diversity problemJournal of the Operational Research Society201162226628010.1057/jors.2010.104
- 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
- ChenYFanZPMaJZengSA hybrid grouping genetic algorithm for reviewer group construction problemExpert Systems with Applications20113832401241110.1016/j.eswa.2010.08.029
- FalkenauerEGenetic Algorithms and Grouping Problems1998
- FanZPChenYMaJZengSA hybrid genetic algorithmic approach to the maximally diverse grouping problemJournal of the Operational Research Society20116271423143010.1057/jors.2010.92
- Gallego M, Laguna M, Martí R and Duarte A (2011). Maximally diverse grouping problem. http://www.optsicom.es/mdgp/, accessed 15 May 2012.
- GallegoMLagunaMMartíRDuarteATabu search with strategic oscillation for the maximally diverse grouping problemJournal of the Operational Research Society201364572473410.1057/jors.2012.66
- GomesCPSelmanBAlgorithm portfoliosArtificial Intelligence20011261–2436210.1016/S0004-3702(00)00081-3
- GuruswamiVPandu RanganCChangMSChangGJWongCKThe Kr-packing problemComputing2001661798910.1007/s006070170039
- HansenPMladenovićNMoreno PérezJAVariable neighbourhood search: Methods and applicationsAnnals of Operations Research2010175136740710.1007/s10479-009-0657-6
- KirkpatrickDGHellPOn the complexity of general graph factor problemsSIAM Journal on Computing198312360160910.1137/0212040
- LiJBehjatLA connectivity based clustering algorithm with application to VLSI circuit partitioningIEEE Transactions on Circuits and Systems–II: Express Briefs200653538438810.1109/TCSII.2005.862174
- LotfiVCervenyRA final-exam-scheduling packageJournal of the Operational Research Society199142320521610.1057/jors.1991.42
- MartíRGallegoMDuarteAPardoEGHeuristics and metaheuristics for the maximum diversity problemJournal of Heuristics201319459161510.1007/s10732-011-9172-4
- MingersJO’BrienFACreating student groups with similar characteristics: A heuristic approachOmega199523331332110.1016/0305-0483(95)00014-F
- PalubeckisGIterated tabu search for the maximum diversity problemApplied Mathematics and Computation2007189137138310.1016/j.amc.2006.11.090
- PalubeckisGKarčiauskasERiškusAComparative performance of three metaheuristic approaches for the maximally diverse grouping problemInformation Technology and Control201140427728510.5755/j01.itc.40.4.977
- PillayNEvolving hyper-heuristics for the uncapacitated examination timetabling problemJournal of the Operational Research Society2012631475810.1057/jors.2011.12
- RemdeSCowlingPDahalKColledgeNSelenskyEAn empirical study of hyperheuristics for managing very large sets of low level heuristicsJournal of the Operational Research Society201263339240510.1057/jors.2011.48
- Streeter M and Smith SF (2008). New techniques for algorithm portfolio design. In: McAllester DA and Myllymäki P (eds). UAI 2008, Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence. AUAI Press: Helsinki, Finland, pp 519–527.
- 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 and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam schedulingOmega199725447348210.1016/S0305-0483(97)00007-8
- WeitzRRLakshminarayananSAn empirical comparison of heuristic methods for creating maximally diverse groupsJournal of the Operational Research Society199849663564610.1057/palgrave.jors.2600510
- YeohHKNorMIMAn algorithm to form balanced and diverse groups of studentsComputer Applications in Engineering Education201119358259010.1002/cae.20338