Similarity Measures for Exam Timetabling Problems
A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance or a small subset of instances related to a given r...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Bahasa: | English |
| Diterbitkan: |
2003
|
| Capaian Atas Talian: | http://eprints.nottingham.ac.uk/355/ http://eprints.nottingham.ac.uk/355/1/rxqMISTA03.pdf |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|