Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. Finding independent sets in a graph using continuous multivariable polynomial formulations;Abello;J. Global Optim.,2001
2. The maximum clique problem;Bomze,1999
3. Algorithms for Minimization without Derivatives;Brent,1973
4. M. Brockington, J.C. Culberson, Camouflaging independent sets in quasi-random graphs, in: D. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, AMS, Providence, RI, 1996, pp. 75–88.
5. Maximum stable set formulations and heuristics based on continuous optimization;Burer;Math. Program.,2002
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献