Linear combinations of heuristics for examination timetabling
From MaRDI portal
(Redirected from Publication:1761893)
Recommendations
- Adaptive linear combination of heuristic orderings in constructing examination timetables
- Solving examination timetabling problems through adaption of heuristic orderings
- A graph-based hyper-heuristic for educational timetabling problems
- The combinatorics of timetabling
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
Cites work
- scientific article; zbMATH DE number 1728534 (Why is no real title available?)
- scientific article; zbMATH DE number 3910116 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 1783852 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- A survey of search methodologies and automated system development for examination timetabling
- A system for computing university examination timetables
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Case-based heuristic selection for timetabling problems
- Chromatic optimisation: Limitations, objectives, uses, references
- Final examination scheduling
- Graph coloring conditions for the existence of solutions to the timetable problem
- Handbook of metaheuristics
- Hybrid variable neighbourhood approaches to university exam timetabling
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- New methods to color the vertices of a graph
- Weighted graphs and university course timetabling
Cited in
(14)- Solving examination timetabling problems through adaption of heuristic orderings
- Extended clique initialisation in examination timetabling
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- Operational research in education
- A constructive approach to examination timetabling based on adaptive decomposition and ordering
- The design and implementation of an interactive course-timetabling system
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- Adaptive linear combination of heuristic orderings in constructing examination timetables
- A graph-based hyper-heuristic for educational timetabling problems
- Automated generation of constructive ordering heuristics for educational timetabling
- An integer programming approach to curriculum-based examination timetabling
- Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems
This page was built for publication: Linear combinations of heuristics for examination timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761893)
