1. Conflict graphs in solving integer programming problems;Atamtürk;European Journal of Operational Research,2000
2. R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0, Technical Report TR98-03, Department of Computational and Applied Mathematics, Rice University, 1998 (Downloadable from website http://www.caam.rice.edu/~bixby/miplib/miplib.html)
3. Solving a truck dispatching scheduling problem using branch-and-cut;Bixby;Operations Research,1998
4. Finding all cliques of an undirected graph;Bron;Communications of the ACM,1973
5. An exact algorithm for the maximum clique problem;Carraghan;Operations Research Letters,1990