Extended clique initialisation in examination timetabling

Journal of the Operational Research Society

Volumn 52, Issue 5, 2001, Pages 538-544

  Carter, M W ^a   Johnson, D G ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Clique; Graph; Timetabling

Indexed keywords

HEURISTIC METHODS; SET THEORY;

CLIQUE INITIALIZATION; TIMETABLING;

GRAPH THEORY;

EID: 0035342724     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601115     Document Type: Article

References (7)

1. Carter MW (1986). A survey of practical examination timetabling problems. Opns Res 34: 193-202.
2. Carter MW, Laporte G and Chinneck JW (1994). A general examination scheduling system, Interfaces 24: 109-120.
3. Carter MW, Laporte G and Lee SY (1996). Examination timetabling: algorithmic strategies and applications, J Opl Res Soc 47: 373-383.
4. Johnson DG (1990). Timetabling university examinations. J Opl Res Soc 40: 39-47.
5. Carraghan R and Pardalos PW (1990). An exact algorithm for the maximum clique problem. Opns Res Lett 9: 375-382.
6. Carter MW and Gendreau M (1992). Finding the Largest Clique in a Graph, Publication CRT-820. Centre de Recherche sur les Transports: Montreal.
7. Bondy JA and Murty USR (1976). Graph Theory with Applications. MacMillan: London.