1. Finding a maximum clique in an arbitrary graph;Balas;SIAM J. Comput.,1986
2. Nodeweighted graphs having the König-Egerváry property;Bourjolly;Math. Programming Stud.,1984
3. A quadratic 0–1 optimization algorithm for the maximum clique and stable set problems;Bourjolly,1996
4. Combinatorial methods for bounding quadratic pseudo-Boolean functions;Bourjolly,1989
5. A combinatorial column generation algorithm for the maximum clique and stable set problems;Bourjolly;Les Cahiers du GERAD, G-94-33,1994