Implementing graph coloring heuristic in construction phase of curriculum-based course timetabling problem
Curriculum-based course timetabling problem (CB-CTP) is a classical problem that is still being researched on nowadays. There are two phases in solving CB-CTP. The first phase is the construction phase where a population of initial solutions is generated. The second phase is the optimization phase w...
| Published in: | IEEE Symposium on Computers and Informatics, ISCI 2013 |
|---|---|
| Main Author: | |
| Format: | Conference paper |
| Language: | English |
| Published: |
IEEE Computer Society
2013
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84886498828&doi=10.1109%2fISCI.2013.6612369&partnerID=40&md5=c9052e9efaa914d792a5e96a6e3d91e1 |