A multiobjective framework for heavily constrained examination timetabling problems (Q613763): Difference between revisions

@@ Property / cites work @@
+Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
+Normal rank
@@ Property / cites work @@
+Principles of Constraint Programming
@@ Property / cites work: Principles of Constraint Programming / rank @@
+Normal rank
@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Solving examination timetabling problems through adaption of heuristic orderings
+Normal rank
@@ Property / cites work @@
+Recent research directions in automated timetabling
+Normal rank
@@ Property / cites work @@
+Q2779805
@@ Property / cites work: Q2779805 / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid variable neighbourhood approaches to university exam timetabling
+Normal rank
@@ Property / cites work @@
+A graph-based hyper-heuristic for educational timetabling problems
+Normal rank
@@ Property / cites work @@
+Q2723294
@@ Property / cites work: Q2723294 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5670645
@@ Property / cites work: Q5670645 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of search methodologies and automated system development for examination timetabling
+Normal rank
@@ Property / cites work @@
+A robust simulated annealing based examination timetabling system.
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank