Approaches used in solving timetabling problem: a review
Integer programming has always been an alternative for formulating combinatorial problems such as the university timetabling problem.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/25398/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|