摘要: For the university timetabling problem that is NP-hard, some new strategies of tackling it are proposed,and two heuristic algorithms based on personification strategies are presented, which outperform the known straightforward heuristic algorithms in the
No related articles found! |
|