Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference14 articles.
1. Regularizing the abstract convex program;Borwein;J. Math. Anal. Appl.,1981
2. S.J. Benson, Y. Ye, Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation, in: M.C. Ferris, O.L. Mangasarian, J.-S. Pang (Eds.), Complementarity: Applications, Algorithms and Extensions (Madison, WI, 1999), Kluwer Academic Publishers, Dordrecht, 2001, pp. 1–17.
3. Semidefinite relaxation for nonconvex programs;Fujie;J. Global Optim.,1997
4. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming;Goemans;J. Assoc. Comput. Mach.,1995
5. Semidefinite programming and graph equipartition;Karisch,1998
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献