Showing 1 - 10 of 30
Persistent link: https://www.econbiz.de/10005348140
Persistent link: https://www.econbiz.de/10005347385
University timetabling is an NP-hard problem, which means that the amount of computation required to find solutions increases exponentially with problem size. Timetabling is subject to hard constraints that must be satisfied in order to produce feasible timetables and soft constraints, which are...
Persistent link: https://www.econbiz.de/10005339964
Persistent link: https://www.econbiz.de/10006648674
Persistent link: https://www.econbiz.de/10007917000
Persistent link: https://www.econbiz.de/10006266380
Persistent link: https://www.econbiz.de/10008900795
Persistent link: https://www.econbiz.de/10005417802
Persistent link: https://www.econbiz.de/10005414296
Persistent link: https://www.econbiz.de/10005318490