Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference45 articles.
1. Balas, E., Ceria, S., Cornuéjols, G., Pataki, G., 1996. Polyhedral methods for the maximum clique problem. In: Johnson & Trick (Eds.), op. cit., pp. 11–28.
2. The chromatic number of random graphs;Bollobás;Combinatorica,1988
3. The maximum clique problem;Bomze,1999
4. Borndörfer, R., 1998. Aspects of Set Packing, Partitioning and Covering. Doctoral Thesis, Technical University of Berlin.
5. Solving lift-and-project relaxations of binary integer programs;Burer;SIAM J. Optim.,2006
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献