Author:
Paquete Luis,Stützle Thomas
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. M.W. Carter. A survey of pratical applications of examination timetabling algorithms. Operations Research, 34(2):193–202, 1986.
2. D.J. Castelino, S. Hurley, and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Research, 63:301–320, 1996.
3. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, USA, 1979.
4. A. Mehrotra and M. Trick. A column generation approach for graph coloring. INFORMS Journal On Computing, 8(4):344–354, 1996.
5. D. Brélaz. New methods to color the vertices of a graph. Communications of the ACM, 22(4):251–256, 1979.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献