Abstract: University course timetabling is a NP-hard problem which is very difficult to solve by conventional methods. A highly constrained combinatorial problem, like the timetable, can be solved by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results