{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:36:13Z","timestamp":1648773373232},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,30]],"date-time":"2013-11-30T00:00:00Z","timestamp":1385769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10898-013-0123-5","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T07:56:23Z","timestamp":1385711783000},"page":"393-423","source":"Crossref","is-referenced-by-count":3,"title":["Handelman\u2019s hierarchy for the maximum stable set problem"],"prefix":"10.1007","volume":"60","author":[{"given":"Monique","family":"Laurent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,30]]},"reference":[{"issue":"1","key":"123_CR1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2140\/pjm.1988.132.35","volume":"132","author":"D Handelman","year":"1988","unstructured":"Handelman, D.: Representing polynomials by positive linear functions on compact convex polyhedra. Pac. J. Math. 132(1), 35\u201362 (1988)","journal-title":"Pac. J. Math."},{"issue":"6","key":"123_CR2","doi-asserted-by":"crossref","first-page":"3104","DOI":"10.1137\/100790835","volume":"20","author":"E Klerk De","year":"2010","unstructured":"De Klerk, E., Laurent, M.: Error bounds for some semidefinite programming approaches to polynomial optimization on the hypercube. SIAM J. Optim. 20(6), 3104\u20133120 (2010)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"123_CR3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.orl.2011.07.006","volume":"39","author":"M-J Park","year":"2011","unstructured":"Park, M.-J., Hong, S.-P.: Rank of Handelman hierarchy for max-cut. Oper. Res. Lett. 39(5), 323\u2013328 (2011)","journal-title":"Oper. Res. Lett."},{"key":"123_CR4","author":"M-J Park","year":"2012","unstructured":"Park, M.-J., Hong, S.-P.: Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications. J. Glob. Optim. (2012). doi: 10.1007\/s10898-012-9906-3","journal-title":"J. Glob. Optim."},{"issue":"5","key":"123_CR5","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/18.42215","volume":"35","author":"J Bruck","year":"1989","unstructured":"Bruck, J., Blaum, M.: Neural networks, error-correcting codes, and polynomials over the binary $$n$$ n -cube. IEEE Trans. Inf. Theory 35(5), 976\u2013987 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"123_CR6","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1016\/j.orl.2008.08.002","volume":"36","author":"D Cornaz","year":"2008","unstructured":"Cornaz, D., Jost, V.: A one-to-one correspondance between colorings and stable sets. Oper. Res. Lett. 36(6), 673\u2013676 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20133","key":"123_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0012-365X(92)00057-X","volume":"124","author":"L Lov\u00e1sz","year":"1994","unstructured":"Lov\u00e1sz, L.: Stable sets and polynomials. Discret Math. 124(1\u20133), 137\u2013153 (1994)","journal-title":"Discret Math."},{"issue":"4","key":"123_CR8","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1017\/S0963548309009894","volume":"18","author":"J Loera De","year":"2009","unstructured":"De Loera, J., Lee, J., Margulies, S., Onn, S.: Expressing combinatorial problems by systems of polynomial equations and Hilbert\u2019s Nullstellensatz. Comb. Probab. Comput. 18(4), 551\u2013582 (2009)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"123_CR9","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 of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4), 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"123_CR10","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1137\/090746525","volume":"20","author":"J Gouveia","year":"2010","unstructured":"Gouveia, J., Parrilo, P., Thomas, R.: Theta bodies for polynomial ideals. SIAM J. Optim. 20(4), 2097\u20132118 (2010)","journal-title":"SIAM J. Optim."},{"key":"123_CR11","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"JB Lasserre","year":"2002","unstructured":"Lasserre, J.B.: An explicit equivalent positive semidefinite program for nonlinear 0\u20131 programs. SIAM J. Optim. 12, 756\u2013769 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"123_CR12","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali\u2013Adams, Lov\u00e1sz\u2013Schrijver and Lasserre relaxation for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013498 (2003)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"123_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"JC Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a, J.C., Vera, J.C., Zuluaga, L.F.: Computing the stability number of a graph via linear and semidefinite programming. SIAM J. Optim. 18(1), 87\u2013105 (2007)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"123_CR14","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for 0\u20131 programming problems. SIAM J. Discret Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discret Math."},{"key":"123_CR15","first-page":"3417","volume":"258","author":"JL Krivine","year":"1964","unstructured":"Krivine, J.L.: Quelques propri\u00e9t\u00e9s des pr\u00e9ordres dans les anneaux commutatifs unitaires. C. R. Acad. Sci. Paris 258, 3417\u20133418 (1964)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"123_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging Applications of Algebraic Geometry","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer, New York (2009)"},{"key":"123_CR17","first-page":"109","volume-title":"Frontiers in Global Optimization","author":"L Faybusovich","year":"2003","unstructured":"Faybusovich, L.: Global optimization of homogeneous polynomials on the simplex and on the sphere. In: Floudas, C., Pardalos, P. (eds.) Frontiers in Global Optimization, pp. 109\u2013121. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"2\u20133","key":"123_CR18","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.tcs.2006.05.011","volume":"361","author":"E Klerk De","year":"2006","unstructured":"De Klerk, E., Laurent, M., Parrilo, P.: A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor. Comput. Sci. 361(2\u20133), 210\u2013225 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"123_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/10997703_7","volume-title":"Positive Polynomials in Control","author":"E Klerk De","year":"2005","unstructured":"De Klerk, E., Laurent, M., Parrilo, P.: On the equivalence of algebraic approaches to the minimization of forms on the simplex. In: Henrion, D., Garulli, A. (eds.) Positive Polynomials in Control, pp. 121\u2013133. Springer, Berlin (2005)"},{"key":"123_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, New York (1972)"},{"issue":"1","key":"123_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"GL Nemhauser","year":"1974","unstructured":"Nemhauser, G.L., Trotter Jr, L.E.: Properties of vertex packing and independence system polyhedra. Math. Program 6(1), 48\u201361 (1974)","journal-title":"Math. Program"},{"issue":"2","key":"123_CR22","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."},{"issue":"2","key":"123_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: A characterization of perfect graphs. J. Comb. Theory B. 13(2), 95\u201398 (1972)","journal-title":"J. Comb. Theory B."},{"key":"123_CR24","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"issue":"1","key":"123_CR25","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51\u2013229 (2006)","journal-title":"Ann. Math."},{"issue":"1\u20133","key":"123_CR26","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10107-003-0407-5","volume":"98","author":"L Lipt\u00e1k","year":"2003","unstructured":"Lipt\u00e1k, L., Tuncel, L.: The stable set problem and the lift-and-project ranks of graphs. Math. Program B 98(1\u20133), 319\u2013353 (2003)","journal-title":"Math. Program B"},{"issue":"2","key":"123_CR27","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/moor.27.2.347.322","volume":"27","author":"JB Lasserre","year":"2002","unstructured":"Lasserre, J.B.: Semidefinite programming vs. LP relaxations for polynomial programming. Math. Oper. Res. 27(2), 347\u2013360 (2002)","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0123-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0123-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0123-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:05Z","timestamp":1559278745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0123-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,30]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["123"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0123-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,30]]}}}