{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:24:30Z","timestamp":1725888270466},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_33","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:04:39Z","timestamp":1495544679000},"page":"405-416","source":"Crossref","is-referenced-by-count":4,"title":["High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts"],"prefix":"10.1007","author":[{"given":"Monaldo","family":"Mastrolilli","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"33_CR1","unstructured":"Au, Y.H., Tun\u00e7el, L.: Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. arXiv preprint arXiv:1608.07647 (2016)"},{"key":"33_CR2","unstructured":"Bansal, N.: Hierarchies reading group. http:\/\/www.win.tue.nl\/nikhil\/hierarchies\/"},{"issue":"1","key":"33_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1052623402420346","volume":"15","author":"D Bienstock","year":"2004","unstructured":"Bienstock, D., Zuckerberg, M.: Subset algebra lift operators for 0-1 integer programming. SIAM J. Optim. 15(1), 63\u201395 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"33_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10107-005-0598-z","volume":"105","author":"D Bienstock","year":"2006","unstructured":"Bienstock, D., Zuckerberg, M.: Approximate fixed-rank closures of covering problems. Math. Program. 105(1), 9\u201327 (2006)","journal-title":"Math. Program."},{"key":"33_CR5","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2013","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.R.: Semidefinite Optimization and Convex Algebraic Geometry, vol. 13. Siam, Philadelphia (2013)"},{"key":"33_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer Publishing Company, Incorporated (2014)"},{"issue":"4","key":"33_CR7","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1137\/140966265","volume":"25","author":"H Fawzi","year":"2015","unstructured":"Fawzi, H., Saunderson, J., Parrilo, P.A.: Equivariant semidefinite lifts and sum-of-squares hierarchies. SIAM J. Optim. 25(4), 2212\u20132243 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"33_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gatermann","year":"2004","unstructured":"Gatermann, K., Parrilo, P.A.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1), 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-20807-2_24","volume-title":"Integer Programming and Combinatoral Optimization","author":"AR Karlin","year":"2011","unstructured":"Karlin, A.R., Mathieu, C., Nguyen, C.T.: Integrality gaps of linear and semi-definite programming relaxations for knapsack. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 301\u2013314. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-20807-2_24"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-319-33461-5_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Kurpisz","year":"2016","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: Sum-of-squares hierarchy lower bounds for symmetric formulations. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 362\u2013374. Springer, Cham (2016). doi: 10.1007\/978-3-319-33461-5_30"},{"issue":"1","key":"33_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/moor.2016.0797","volume":"42","author":"A Kurpisz","year":"2017","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: On the hardest problem formulations for the 0\/1 lasserre hierarchy. Math. Oper. Res. 42(1), 135\u2013143 (2017)","journal-title":"Math. Oper. Res."},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem. Mathematical Programming (2017, to appear)","DOI":"10.1007\/s10107-016-1102-7"},{"issue":"3","key":"33_CR13","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"33_CR14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.orl.2011.07.003","volume":"39","author":"AN Letchford","year":"2011","unstructured":"Letchford, A.N., Pokutta, S., Schulz, A.S.: On the membership problem for the {0, 1\/2}-closure. Oper. Res. Lett. 39(5), 301\u2013304 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"33_CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"33_CR16","doi-asserted-by":"crossref","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Log. 62(3), 981\u2013998 (1997)","journal-title":"J. Symb. Log."},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Raymond, A., Saunderson, J., Singh, M., Thomas, R.R.: Symmetric sums of squares over $$ k $$ -subset hypercubes. arXiv preprint arXiv:1606.05639 (2016)","DOI":"10.1007\/s10107-017-1127-6"},{"issue":"6","key":"33_CR18","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/BF01070233","volume":"23","author":"N Shor","year":"1987","unstructured":"Shor, N.: Class of global minimum bounds of polynomial functions. Cybern. Syst. Anal. 23(6), 731\u2013734 (1987)","journal-title":"Cybern. Syst. Anal."},{"key":"33_CR19","unstructured":"Zuckerberg, M.: A set theoretic approach to lifting procedures for 0, 1 integer programming. Ph.D. thesis, Columbia University (2004)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T18:04:40Z","timestamp":1692813880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}