A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming

References

• 1. J. Abello, S. Butenko, P. M. Pardalos and M. G. C. Resende, Finding independent sets in a graph using continuous multivariable polynomial formulations, J. Global Optim. 21 (2001) 111–137. Crossref, Google Scholar
• 2. I. M. Bomze, M. Budinich, P. M. Pardalos and M. Pelillo, The maximum clique problem, in Handbook of Combinatorial Optimization, Vol. A, eds. D.-Z. DuP. M. Pardalos (Kluwer Academic Publishers, 1999), pp. 1–74. Crossref, Google Scholar
• 3. D. M. Cardoso, Convex quadratic programming approach to the maximum matching problem, J. Global Optim. 21 (2001) 91–106. Crossref, Google Scholar
• 4. D. M. Cardoso and C. J. Luz, A simplex like approach based on star set for recognizing convex-$QP$ adverse graphs, J. Combin. Optim. (2014), doi: 10.107/s10870-014-9745-x. Google Scholar
• 5. E. De Klerk and D. V. Pasechnik, Approximating the stability number of a graph via copositive programming, SIAM J. Optim. 12 (2002) 875–892. Crossref, Google Scholar
• 6. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences is combinatorial optimization, Combinatorica 1 (1981) 169–197. Crossref, Google Scholar
• 7. M. Grötschel, L. Lovász and A. Schrijver, Relaxations of vertex packing, J. Combin. Theory Ser. B 40 (1986) 330–343. Crossref, Google Scholar
• 8. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, 1988). Crossref, Google Scholar
• 9. D. E. Knuth, The sandwich theorem, Electron. J. Combin. 1 (1994), Article $\#$A1, 1–48. Google Scholar
• 10. L. Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25(2) (1979) 1–7. Crossref, Google Scholar
• 11. L. Lovász and A. Schrijver, Cones of matrices and set-functions and 0–1 optimization, SIAM J. Optim. 1(2) (1991) 166–190. Crossref, Google Scholar
• 12. C. J. Luz, An upper bound on the independence number of a graph computable in polynomial time, Oper. Res. Lett. 18 (1995) 139–145. Crossref, Google Scholar
• 13. C. J. Luz and D. M. Cardoso, A generalization of the Hoffman–Lovász upper bound on the independence number of a regular graph, Ann. Oper. Res. 81 (1998) 307–319. Crossref, Google Scholar
• 14. C. J. Luz and D. M. Cardoso, A quadratic programming approach to the determination of an upper bound on the weighted stability number, European J. Oper. Res. 132 (2001) 569–581. Crossref, Google Scholar
• 15. C. J. Luz and A. Schrijver, A convex quadratic characterization of the Lovász theta number, SIAM J. Discrete Math. 19(2) (2005) 382–387. Crossref, Google Scholar
• 16. R. J. McEliece, E. R. Rodemich and H. C. Rumsey Jr., The Lovász bound and some generalizations, J. Combin. Inf. Syst. Sci. 3 (1978) 134–152. Google Scholar
• 17. T. S. Motzkin and E. G. Straus, Maxima for graphs and a new proof of a theorem of Turán, Canad. J. Math. 17 (1965) 533–540. Crossref, Google Scholar
• 18. A. Schrijver, A comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory 25(4) (1979) 425–429. Crossref, Google Scholar
• 19. Q. Wu and J.-K. Hao, A review on algorithms for maximum clique problem, European J. Oper. Res. 242 (2015) 693–709. Crossref, Google Scholar