This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number of tuples, each consisting of class of students, a teacher, a subject and a room ...

This is a preview. Log in through your library . Abstract We present a modification of the simulated annealing algorithm designed for solving discrete stochastic optimization problems. Like the ...

In computer science, normally we care about asymptotic speedup: We care about, “What is your running time as a function of the size of the problem? Does it grow linearly? Does it grow quadratically?” ...