{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:41:34Z","timestamp":1648917694520},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T00:00:00Z","timestamp":1434672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11590-015-0911-6","type":"journal-article","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T14:29:20Z","timestamp":1434637760000},"page":"19-31","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A characterization of the weighted Lov\u00e1sz number based on convex quadratic programming"],"prefix":"10.1007","volume":"10","author":[{"given":"Carlos J.","family":"Luz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,19]]},"reference":[{"key":"911_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1011968411281","volume":"21","author":"J Abello","year":"2001","unstructured":"Abello, J., Butenko, S., Pardalos, P.M., Resende, M.G.C.: Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21, 111\u2013137 (2001)","journal-title":"J. Glob. Optim."},{"key":"911_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. A, pp. 1\u201374. Kluwer Academic Publishers, Dordrecht, The Netherlands (1999)"},{"key":"911_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1017969603632","volume":"21","author":"DM Cardoso","year":"2001","unstructured":"Cardoso, D.M.: Convex quadratic programming approach to the maximum matching problem. J. Glob. Optim. 21, 91\u2013106 (2001)","journal-title":"J. Glob. Optim."},{"key":"911_CR4","unstructured":"Cardoso, D.M., Luz, C.J.: A simplex like approach based on star set for recognizing convex- $$QP$$ Q P adverse graphs. J. Comb. Optim. (2014). doi: 10.107\/s10870-014-9745-x"},{"key":"911_CR5","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E Klerk De","year":"2002","unstructured":"De Klerk, E., Pasechnik, D.V.: Approximating the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"911_CR6","unstructured":"DIMACS: Cliques, coloring, and satisfiability: second dimacs implementation challenge. http:\/\/dimacs.rutgers.edu\/Challenges\/ (1995)"},{"key":"911_CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences is combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"911_CR8","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0095-8956(86)90087-0","volume":"40","author":"M Gr\u00f6tschel","year":"1986","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Relaxations of vertex packing. J. Comb. Theory Ser. B 40, 330\u2013343 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"key":"911_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"911_CR10","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: The sandwich theorem. Electron. J. Comb. 1, 1\u201348, Article #A1 (1994)","DOI":"10.37236\/1193"},{"issue":"1","key":"911_CR11","first-page":"3495","volume":"14","author":"V Jethava","year":"2013","unstructured":"Jethava, V., Martinsson, A., Bhattacharyya, C., Dubhashi, D.: Lov\u00e1sz $$\\vartheta $$ \u03d1 function, SVMs and finding dense subgraphs. J. Mach. Learn. Res. 14(1), 3495\u20133536 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"911_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25(2), 1\u20137 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"911_CR13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"911_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(95)00042-9","volume":"18","author":"CJ Luz","year":"1995","unstructured":"Luz, C.J.: An upper bound on the independence number of a graph computable in polynomial time. Oper. Res. Lett. 18, 139\u2013145 (1995)","journal-title":"Oper. Res. Lett."},{"key":"911_CR15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1018965309522","volume":"81","author":"CJ Luz","year":"1998","unstructured":"Luz, C.J., Cardoso, D.M.: A generalization of the Hoffman-Lov\u00e1sz upper bound on the independence number of a regular graph. Ann. Oper. Res. 81, 307\u2013319 (1998)","journal-title":"Ann. Oper. Res."},{"key":"911_CR16","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/S0377-2217(00)00162-4","volume":"132","author":"CJ Luz","year":"2001","unstructured":"Luz, C.J., Cardoso, D.M.: A quadratic programming approach to the determination of an upper bound on the weighted stability number. Eur. J. Oper. Res. 132, 569\u2013581 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"911_CR17","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/S0895480104429181","volume":"19","author":"CJ Luz","year":"2005","unstructured":"Luz, C.J., Schrijver, A.: A convex quadratic characterization of the Lov\u00e1sz theta number. SIAM J. Discrete Math. 19(2), 382\u2013387 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"911_CR18","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"key":"911_CR19","first-page":"69","volume":"109","author":"P Seymour","year":"2006","unstructured":"Seymour, P.: How the proof of the strong perfect graph conjecture was found. Gazette des Math\u00e9maticiens 109, 69\u201383 (2006)","journal-title":"Gazette des Math\u00e9maticiens"},{"key":"911_CR20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. Ser. B 95, 189\u2013217 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"911_CR21","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.-K.: A review on algorithms for maximum clique problem. Eur. J. Oper. Res. 242, 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0911-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0911-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0911-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T19:25:53Z","timestamp":1599161153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0911-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,19]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["911"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0911-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,19]]}}}