Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Michael W. Carter. A survey of practical applications of examination timetabling algorithms. Operations Research, 34(2):193–202, 1986.
2. Michael W. Carter and Gilbert Laporte. Recent Developments in Practical Examination Timetabling. In Edmund Burke and Peter Ross, editors, Practice and Theory of Automated Timetabling, volume 1153 of Lectures Notes in Computer Science, pages 3–21. Springer-Verlag, 1996.
3. Alan K. Mackworth and Eugene C. Freuder. The complexity of constraint satisfaction revisited. Artificial Intelligence, 59:57–62, 1993.
4. Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1–3):161–205, December 1992.
5. Bart Selman, Hector Levesque, and David Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-92), pages 440–446, San Jose, CA, 1992.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献