Constraint logic programming for examination timetabling
From MaRDI portal
Recommendations
Cited in
(13)- A logic approach to the resolution of constraints in timetabling
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- scientific article; zbMATH DE number 1728545 (Why is no real title available?)
- Programmed search in a timetabling problem over finite domains
- scientific article; zbMATH DE number 1192259 (Why is no real title available?)
- scientific article; zbMATH DE number 516792 (Why is no real title available?)
- Object-oriented constraint logic programming for timetable planning
- A constructive approach to examination timetabling based on adaptive decomposition and ordering
- A survey of search methodologies and automated system development for examination timetabling
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
This page was built for publication: Constraint logic programming for examination timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128626)