Extended clique initialisation in examination timetabling
From MaRDI portal
Publication:4658438
DOI10.1057/palgrave.jors.2601115zbMath1114.90378OpenAlexW2090782061MaRDI QIDQ4658438
No author found.
Publication date: 16 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601115
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
A survey of search methodologies and automated system development for examination timetabling ⋮ A review on algorithms for maximum clique problems ⋮ A multi-objective evolutionary algorithm for examination timetabling ⋮ Operational research in education ⋮ Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
This page was built for publication: Extended clique initialisation in examination timetabling
