{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:12:45Z","timestamp":1764936765106},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,6]],"date-time":"2015-03-06T00:00:00Z","timestamp":1425600000000},"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":["Math. Program."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10107-015-0879-0","type":"journal-article","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T09:12:17Z","timestamp":1425546737000},"page":"659-680","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Exploiting symmetry in copositive programs via semidefinite hierarchies"],"prefix":"10.1007","volume":"151","author":[{"given":"Cristian","family":"Dobre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Vera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,6]]},"reference":[{"key":"879_CR1","unstructured":"Arima, N., Kim, S., Kojima. M.: A quadratically constrained quadratic optimization model for completely positive cone programming. Technical Report B-468, Dept. of Math. and Comp. Sciences, Tokyo Institute of Technology (2012). http:\/\/www.optimization-online.org\/DB_FILE\/2012\/09\/3600"},{"key":"879_CR2","doi-asserted-by":"crossref","unstructured":"Bachoc, C., Gijswijt, D., Schrijver, A., Vallentin, F.: Invariant semidefinite programs. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, vol. 166, pp. 219\u2013269. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-0769-0_9"},{"key":"879_CR3","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1090\/S0894-0347-07-00589-9","volume":"21","author":"C Bachoc","year":"2008","unstructured":"Bachoc, C., Vallentin, F.: New upper bounds for kissing numbers from semidefinite programming. J. Am. Math. Soc. 21, 909\u2013924 (2008)","journal-title":"J. Am. Math. Soc."},{"issue":"3","key":"879_CR4","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s11081-008-9050-6","volume":"10","author":"Y-Q Bai","year":"2009","unstructured":"Bai, Y.-Q., de Klerk, E., Pasechnik, D.V., Sotirov, R.: Exploiting group symmetry in truss topology optimization. Optim. Eng. 10(3), 331\u2013349 (2009)","journal-title":"Optim. Eng."},{"key":"879_CR5","unstructured":"Bai, L., Mitchell, J.E., Pang, J.: On QPCCs, QCQPs and copositive programs. Technical report, Rensselaer Polytechnic Institute (2012). http:\/\/eaton.math.rpi.edu\/faculty\/Mitchell\/papers\/QCQP_QPCC.html"},{"key":"879_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"IM Bomze","year":"2012","unstructured":"Bomze, I.M.: Copositive optimization\u2014recent developments and applications. Eur. J. Oper. Res. 216, 509\u2013520 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"879_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., D\u00fcr, M., de Klerk, E., Roos, C., Quist, A.J., Terlaky, T.: On copositive programming and standard quadratic optimization problems. J. Glob. Optim. 18, 301\u2013320 (2000)","journal-title":"J. Glob. Optim."},{"key":"879_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s10107-010-0363-9","volume":"124","author":"IM Bomze","year":"2010","unstructured":"Bomze, I.M., Frommlet, F., Locatelli, M.: Copositivity cuts for improving SDP bounds on the clique number. Math. Program. 124, 13\u201332 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"879_CR9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s11590-010-0174-1","volume":"4","author":"IM Bomze","year":"2010","unstructured":"Bomze, I.M., Jarre, F.: A note on Burer\u2019s copositive representation of mixed-binary QPs. Optim. Lett. 4(3), 465\u2013472 (2010)","journal-title":"Optim. Lett."},{"issue":"1","key":"879_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s12532-011-0022-z","volume":"3","author":"IM Bomze","year":"2011","unstructured":"Bomze, I.M., Jarre, F., Rendl, F.: Quadratic factorization heuristics for copositive programming. Math. Program. Comput. 3(1), 37\u201357 (2011)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"879_CR11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via semidefinite and copositive programming. J. Glob. Optim. 24(2), 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"key":"879_CR12","unstructured":"Bundfuss, S.: Copositive Matrices, Copositive Programming, and Applications. PhD thesis, TU Darmstadt (2009)"},{"key":"879_CR13","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1016\/j.laa.2007.09.035","volume":"428","author":"S Bundfuss","year":"2009","unstructured":"Bundfuss, S., D\u00fcr, M.: Algorithmic copositive detection by simplicial partition. Linear Algebra Appl. 428, 1511\u20131523 (2009)","journal-title":"Linear Algebra Appl."},{"key":"879_CR14","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/070711815","volume":"20","author":"S Bundfuss","year":"2009","unstructured":"Bundfuss, S., D\u00fcr, M.: An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim. 20, 30\u201353 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"879_CR15","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. A 120(2), 479\u2013495 (2009)","journal-title":"Math. Program. A"},{"issue":"3","key":"879_CR16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"40","author":"S Burer","year":"2012","unstructured":"Burer, S., Dong, H.: Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. 40(3), 203\u2013206 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"879_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"key":"879_CR18","unstructured":"Dobre, C.: Semidefinite programming approaches for structured combinatorial optimization problems. PhD-thesis. Tilburg University, The Netherlands (2011)"},{"issue":"3","key":"879_CR19","doi-asserted-by":"crossref","first-page":"1850","DOI":"10.1137\/100813816","volume":"23","author":"H Dong","year":"2013","unstructured":"Dong, H.: Symmetric tensor approximation hierarchies for the completely positive cone. SIAM J. Optim. 23(3), 1850\u20131866 (2013)","journal-title":"SIAM J. Optim."},{"key":"879_CR20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10107-011-0485-8","volume":"137","author":"H Dong","year":"2013","unstructured":"Dong, H., Anstreicher, K.: Separating doubly nonnegative and completely positive matrices. Math. Program. 137, 131\u2013153 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"879_CR21","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-008-0233-x","volume":"121","author":"I Dukanovic","year":"2010","unstructured":"Dukanovic, I., Rendl, F.: Copositive programming motivated bounds on the stability and the chromatic numbers. Math. Program. 121(2), 249\u2013268 (2010)","journal-title":"Math.. Program."},{"key":"879_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-12598-0_1","volume-title":"Recent Advances in Optimization and its Applications in Engineering","author":"M D\u00fcr","year":"2010","unstructured":"D\u00fcr, M.: Copositive programming\u2014a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds.) Recent Advances in Optimization and its Applications in Engineering, pp. 3\u201320. Springer, Berlin (2010)"},{"key":"879_CR23","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, 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"key":"879_CR24","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.jcta.2006.03.010","volume":"113","author":"D Gijswijt","year":"2006","unstructured":"Gijswijt, D., Schrijver, A., Tanaka, H.: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Comb. Theory Ser. A 113, 1719\u20131731 (2006)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"879_CR25","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/050648237","volume":"19","author":"N Gvozdenovi\u0107","year":"2008","unstructured":"Gvozdenovi\u0107, N., Laurent, M.: The operator $$\\psi $$ \u03c8 for the chromatic number of a graph. SIAM J. Optim. 19(2), 572\u2013591 (2008). N","journal-title":"SIAM J. Optim."},{"issue":"2","key":"879_CR26","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1137\/070683520","volume":"19","author":"N Gvozdenovi\u0107","year":"2008","unstructured":"Gvozdenovi\u0107, N., Laurent, M.: Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization. SIAM J. Optim. 19(2), 592\u2013615 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"879_CR27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1015366416311","volume":"2","author":"Y Kanno","year":"2001","unstructured":"Kanno, Y., Ohsaki, M., Murota, K., Katoh, N.: Group symmetry in interior-point methods for semidefinite program. Optim. Eng. 2(3), 293\u2013320 (2001)","journal-title":"Optim. Eng."},{"key":"879_CR28","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","volume":"9","author":"DJ Kleitman","year":"1970","unstructured":"Kleitman, D.J.: The crossing number of $$K_{5, n}$$ K 5 , n . J. Comb. Theory 9, 315\u2013323 (1970)","journal-title":"J. Comb. Theory"},{"issue":"1","key":"879_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.01.025","volume":"201","author":"E Klerk de","year":"2010","unstructured":"de Klerk, E.: Exploiting special structure in semidefinite programming: a survey of theory and applications. Eur. J. Oper. Res. 201(1), 1\u201310 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"879_CR30","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/S0895480104442741","volume":"20","author":"E Klerk de","year":"2006","unstructured":"de Klerk, E., Maharry, J., Pasechnik, D.V., Richter, B., Salazar, G.: Improved bounds for the crossing numbers of $$K_{m, n}$$ K m , n and $$K_n$$ K n . SIAM J. Discrete Math. 20, 189\u2013202 (2006)","journal-title":"SIAM J. Discrete Math."},{"issue":"16","key":"879_CR31","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1016\/j.dam.2011.01.026","volume":"159","author":"E Klerk de","year":"2011","unstructured":"de Klerk, E., Dobre, C.: A comparison of lower bounds for the symmetric circulant traveling salseman problem. Discrete Appl. Math 159(16), 1815\u20131826 (2011)","journal-title":"Discrete Appl. Math"},{"key":"879_CR32","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0461-3","volume":"129","author":"E Klerk de","year":"2011","unstructured":"de Klerk, E., Dobre, C., Pasechnik, D.V.: Numerical block diagonalization of matrix $$*$$ \u2217 -algebras with application to semidefinite programming. Math. Program. B 129, 91\u2013111 (2011)","journal-title":"Math. Program. B"},{"issue":"2","key":"879_CR33","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10107-012-0603-2","volume":"136","author":"E Klerk de","year":"2012","unstructured":"de Klerk, E., Dobre, C., Pasechnik, D.V., Sotirov, R.: On semidefinite programming relaxations of maximum k-section. Math. Program. B 136(2), 253\u2013278 (2012)","journal-title":"Math. Program. B"},{"issue":"2\u20133","key":"879_CR34","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.: 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":"879_CR35","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.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"issue":"2\u20133","key":"879_CR36","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10107-006-0039-7","volume":"109","author":"E Klerk de","year":"2007","unstructured":"de Klerk, E., Pasechnik, D.V., Schrijver, A.: Reduction of symmetric semidefinite programs using the regular *-representation. Math. Program. B 109(2\u20133), 613\u2013624 (2007)","journal-title":"Math. Program. B"},{"issue":"4","key":"879_CR37","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1137\/070711141","volume":"19","author":"E Klerk de","year":"2008","unstructured":"de Klerk, E., Pasechnik, D.V., Sotirov, R.: On semidefinite programming relaxations of the traveling salesman problem. SIAM J. Optim. 19(4), 1559\u20131573 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"879_CR38","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.ejor.2013.10.007","volume":"233","author":"E Klerk de","year":"2014","unstructured":"de Klerk, E., E.-Nagy, M., Sotirov, R., Truetsch, U.: Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems. Eur. J. Oper. Res. 233(3), 488\u2013499 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"879_CR39","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-008-0246-5","volume":"122","author":"E Klerk de","year":"2010","unstructured":"de Klerk, E., Sotirov, R.: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. Ser. A 122(2), 225\u2013246 (2010)","journal-title":"Math. Program. Ser. A"},{"key":"879_CR40","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization problems with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"2\u20133","key":"879_CR41","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10107-006-0030-3","volume":"109","author":"M Laurent","year":"2007","unstructured":"Laurent, M.: Strengthened semidefinite bounds for codes. Math. Program. 109(2\u20133), 239\u2013261 (2007)","journal-title":"Math. Program."},{"key":"879_CR42","doi-asserted-by":"crossref","unstructured":"Lfberg, J.: YALMIP : a toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)","DOI":"10.1109\/CACSD.2004.1393890"},{"issue":"2","key":"879_CR43","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10586458.2010.10129070","volume":"19","author":"HD Mittelmann","year":"2010","unstructured":"Mittelmann, H.D., Vallentin, F.: High-accuracy semidefinite programming bounds for kissing number. Exp. Math. 19(2), 175\u2013179 (2010)","journal-title":"Exp. Math."},{"issue":"1","key":"879_CR44","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s13160-010-0006-9","volume":"27","author":"K Murota","year":"2010","unstructured":"Murota, K., Kanno, Y., Kojima, M., Kojima, S.: A numerical algorithm for block-diagonal decomposition of matrix *-algebras with application to semidefinite programming. Jpn. J. Ind. Appl. Math. 27(1), 125\u2013160 (2010)","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"3","key":"879_CR45","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1287\/opre.1110.0918","volume":"59","author":"K Natarajan","year":"2011","unstructured":"Natarajan, K., Teo, C.P., Zheng, Z.: Mixed 0\u20131 linear programs under objective uncertainty: a completely positive representation. Oper. Res. 59(3), 713\u2013728 (2011)","journal-title":"Oper. Res."},{"key":"879_CR46","unstructured":"Parrilo, P.: Structured Semidefinite programming and Algebraic Geometry Methods in Robustness and Optimization. PhD thesis, California Institute of Technology, Pasadena, CA, USA (2000)"},{"issue":"4","key":"879_CR47","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1137\/03060151X","volume":"16","author":"J Pe\u00f1a","year":"2006","unstructured":"Pe\u00f1a, J., Vera, J.C., Zuluaga, L.F.: LMI approximations for cones of positive semidefinite forms. SIAM J. Optim. 16(4), 1076\u20131091 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"879_CR48","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a, J., 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."},{"key":"879_CR49","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a, J., Vera, J.C., Zuluaga, L.F.: Completely positive reformulations for polynomial optimization. Math. Program. Ser. B 1\u201327 (2014). doi: 10.1007\/s10107-014-0822-9","DOI":"10.1007\/s10107-014-0822-9"},{"key":"879_CR50","unstructured":"Pe\u00f1a, J., Vera, J.C., Zuluaga, L.F.: Personal Comunication"},{"key":"879_CR51","first-page":"141","volume":"73","author":"G P\u00f3lya","year":"1928","unstructured":"P\u00f3lya, G.: Uber positive Darstellung von Polynomen. Vierteljschr. Naturforsch. Ges. Z\u00fcrich 73, 141\u2013145 (1928)","journal-title":"Vierteljschr. Naturforsch. Ges. Z\u00fcrich"},{"key":"879_CR52","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J Povh","year":"2009","unstructured":"Povh, J., Rendl, F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optim. 6, 231\u2013241 (2009)","journal-title":"Discrete Optim."},{"key":"879_CR53","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J Povh","year":"2007","unstructured":"Povh, J., Rendl, F.: A copositive programming approach to graph partitioning. SIAM J. Optim. 18, 223\u2013241 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"879_CR54","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1287\/moor.1120.0558","volume":"38","author":"C Riener","year":"2013","unstructured":"Riener, C., Theobald, T., Andr\u00e9n, L.J., Lasserre, J.B.: Exploiting symmetries in SDP relaxations for polynomial optimization. Math. Oper. Res. 38(1), 122\u2013141 (2013)","journal-title":"Math. Oper. Res."},{"key":"879_CR55","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/10556789808805692","volume":"9","author":"AJ Quist","year":"1998","unstructured":"Quist, A.J., de Klerk, E., Roos, C., Terlaky, T.: Copositive relaxation for general quadratic programming. Optim. Methods Softw. 9, 185\u2013208 (1998)","journal-title":"Optim. Methods Softw."},{"key":"879_CR56","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A Schrijver","year":"1979","unstructured":"Schrijver, A.: A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inf. Theory 25, 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"879_CR57","doi-asserted-by":"crossref","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A Schrijver","year":"2005","unstructured":"Schrijver, A.: New code upper bounds from the Terwilliger algebra. IEEE Trans. Inf. Theory 51, 2859\u20132866 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"879_CR58","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1080\/10556780902896608","volume":"24","author":"R Sotirov","year":"2009","unstructured":"Sotirov, R., de Klerk, E.: A new library of structured semidefinite programming instances. Optim. Methods Softw. 24(6), 959\u2013971 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"879_CR59","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10898-011-9766-2","volume":"52","author":"J Sponsel","year":"2012","unstructured":"Sponsel, J., Bundfuss, S., D\u00fcr, M.: An improved algorithm to test copositivity. J. Glob. Optim. 52(3), 537\u2013551 (2012)","journal-title":"J. Glob. Optim."},{"key":"879_CR60","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/jgt.3190010105","volume":"1","author":"P Tur\u00e1n","year":"1977","unstructured":"Tur\u00e1n, P.: A note of welcome. J. Graph Theory. 1, 7\u20139 (1977)","journal-title":"J. Graph Theory."},{"key":"879_CR61","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH Tutuncu","year":"2003","unstructured":"Tutuncu, 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"},{"issue":"1","key":"879_CR62","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.laa.2008.07.025","volume":"430","author":"F Vallentin","year":"2009","unstructured":"Vallentin, F.: Symmetry in semidefinite programs. Linear Algebra Appl. 430(1), 360\u2013369 (2009)","journal-title":"Linear Algebra Appl."},{"key":"879_CR63","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1002\/jgt.3190170602","volume":"17","author":"DR Woodall","year":"1993","unstructured":"Woodall, D.R.: Cyclic-order graphs and Zarankiewicz\u2019s crossing number conjecture. J. Graph Theory 17, 657\u2013671 (1993)","journal-title":"J. Graph Theory"},{"key":"879_CR64","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4064\/fm-41-1-137-145","volume":"41","author":"K Zarankiewicz","year":"1954","unstructured":"Zarankiewicz, K.: On a problem of P. Tur\u00e1n concerning graphs. Fund. Math. 41, 137\u2013145 (1954)","journal-title":"Fund. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0879-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0879-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0879-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T17:39:35Z","timestamp":1566409175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0879-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,6]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["879"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0879-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,6]]}}}