{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T06:33:47Z","timestamp":1722580427872},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T00:00:00Z","timestamp":1442275200000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10479-015-2015-1","type":"journal-article","created":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T12:50:58Z","timestamp":1442321458000},"page":"119-140","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Semidefinite relaxations for partitioning, assignment and ordering problems"],"prefix":"10.1007","volume":"240","author":[{"given":"F.","family":"Rendl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"2015_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190001","volume":"1","author":"MF Anjos","year":"2005","unstructured":"Anjos, M. F. (2005). Semidefinite optimization approaches to satisfiability and maximum-satisfiability problems. Journal of Satisfiability, Boolean Modeling and Computation, 1, 1\u201347.","journal-title":"Journal of Satisfiability, Boolean Modeling and Computation"},{"key":"2015_CR2","series-title":"International series in Operations Research and Management Science","volume-title":"Handbook on semidefinite, conic and polynomial optimization","year":"2012","unstructured":"Anjos, M. F., & Lasserre, J. B. (Eds.). (2012). Handbook on semidefinite, conic and polynomial optimization., International series in Operations Research and Management Science Berlin: Springer."},{"key":"2015_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.disopt.2005.03.001","volume":"2","author":"MF Anjos","year":"2005","unstructured":"Anjos, M. F., Kennings, A., & Vanelli, A. (2005). A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optimization, 2, 113\u2013122.","journal-title":"Discrete Optimization"},{"key":"2015_CR4","series-title":"A Computational Study","volume-title":"The traveling salesman problem","author":"DL Applegate","year":"2006","unstructured":"Applegate, D. L., Bixby, R. E., Chv\u00e1tal, V., & Cook, W. J. (2006). The traveling salesman problem., A Computational Study Princeton: Princeton University Press."},{"key":"2015_CR5","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/moor.10.2.340","volume":"10","author":"F Barahona","year":"1985","unstructured":"Barahona, F., Gr\u00f6tschel, M., & Mahjoub, A. (1985). Facets of the bipartite subgraph polytope. Mathematics of Operations Research, 10, 340\u2013358.","journal-title":"Mathematics of Operations Research"},{"key":"2015_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M., & Reinelt, G. (1989). Experiments in quadratic 0\u20131 programming. Mathematical Programming, 44, 127\u2013137.","journal-title":"Mathematical Programming"},{"key":"2015_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F Barahona","year":"1986","unstructured":"Barahona, F., & Mahjoub, A. (1986). On the cut polytope. Mathematical Programming, 36, 157\u2013173.","journal-title":"Mathematical Programming"},{"key":"2015_CR8","unstructured":"Blekherman, G., Parillo, P. A., & Thomas, R. (2013). Semidefinite optimization and convex algebraic geometry. MOS-SIAM Series in Optimization."},{"key":"2015_CR9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1287\/ijoc.1090.0318","volume":"22","author":"C Buchheim","year":"2009","unstructured":"Buchheim, C., Wiegele, A., & Zheng, L. (2009). Exact algorithms for the quadratic linear ordering problem. INFORMS Journal on Computing, 22, 168\u2013177.","journal-title":"INFORMS Journal on Computing"},{"key":"2015_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment problems","author":"RE Burkard","year":"2009","unstructured":"Burkard, R. E., Dell\u2019Amico, M., & Martello, S. (2009). Assignment problems. Philadelphia: SIAM."},{"key":"2015_CR11","doi-asserted-by":"crossref","unstructured":"Chimani, M., Hungerl\u00e4nder, P., J\u00fcnger, M., & Mutzel, P. (2011). An SDP approach to multi-level crossing minimization. In Proceedings of algorithm engineering and experiments [ALENEX\u20192011].","DOI":"10.1137\/1.9781611972917.12"},{"key":"2015_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Aspects of semidefinite programming: Interior point algorithms and selected applications","author":"E Klerk de","year":"2002","unstructured":"de Klerk, E. (2002). Aspects of semidefinite programming: Interior point algorithms and selected applications. Alphen aan den Rijn: Kluwer Academic Publishers."},{"issue":"3","key":"2015_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/B:JOCO.0000038911.67280.3f","volume":"8","author":"E Klerk de","year":"2004","unstructured":"de Klerk, E., Pasechnik, D. V., & Warners, J. P. (2004). On approximate graph colouring and max- $$k$$ k -cut algorithms based on the $$\\vartheta $$ \u03d1 -function. Journal of Combinatorial Optimization, 8(3), 267\u2013294.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2015_CR14","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"C Delorme","year":"1993","unstructured":"Delorme, C., & Poljak, S. (1993). Laplacian eigenvalues and the maximum cut problem. Mathematical Programming, 62, 557\u2013574.","journal-title":"Mathematical Programming"},{"issue":"1","key":"2015_CR15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C Simone De","year":"1990","unstructured":"De Simone, C. (1990). The cut polytope and the Boolean quadric polytope. Discrete Mathhematics, 79(1), 71\u201375.","journal-title":"Discrete Mathhematics"},{"key":"2015_CR16","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01303512","volume":"13","author":"M Deza","year":"1993","unstructured":"Deza, M., Grishukhin, V. P., & Laurent, M. (1993). The hypermetric cone is polyhedral. Combinatorica, 13, 397\u2013411.","journal-title":"Combinatorica"},{"key":"2015_CR17","first-page":"157","volume":"38","author":"RJ Duffin","year":"1956","unstructured":"Duffin, R. J. (1956). Infinite programs. Annals of Mathematics Studies, 38, 157\u2013170.","journal-title":"Annals of Mathematics Studies"},{"key":"2015_CR18","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-005-0661-9","volume":"105","author":"I Fischer","year":"2006","unstructured":"Fischer, I., Gruber, G., Rendl, F., & Sotirov, R. (2006). Computational experience with a bundle method for semidefinite cutting plane relaxations of max-cut and equipartition. Mathematical Programming, 105, 451\u2013469.","journal-title":"Mathematical Programming"},{"issue":"1","key":"2015_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A Frieze","year":"1997","unstructured":"Frieze, A., & Jerrum, M. (1997). Improved approximation algorithms for Max $$k$$ k -cut and max bisection. Algorithmica, 18(1), 67\u201381.","journal-title":"Algorithmica"},{"key":"2015_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10479-008-0481-4","volume":"188","author":"B Ghaddar","year":"2011","unstructured":"Ghaddar, B., Anjos, M. F., & Liers, F. (2011). A branch-and-cut algorithm based on semidefinite programming for the minimum $$k$$ k -partition problem. Annals of Operations Research, 188, 155\u2013174.","journal-title":"Annals of Operations Research"},{"key":"2015_CR21","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M. X., & Williamson, D. P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42, 1115\u20131145.","journal-title":"Journal of the ACM"},{"issue":"2","key":"2015_CR22","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.jcss.2003.07.012","volume":"68","author":"MX Goemans","year":"2004","unstructured":"Goemans, M. X., & Williamson, D. P. (2004). Approximation algorithms for max-3-cut and other problems via complex semidefinite programming. Journal of Computer and System Sciences, 68(2), 442\u2013470.","journal-title":"Journal of Computer and System Sciences"},{"key":"2015_CR23","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1002\/rsa.10035","volume":"20","author":"E Halperin","year":"2002","unstructured":"Halperin, E., & Zwick, U. (2002). A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Structures and Algorithms, 20, 382\u2013402.","journal-title":"Random Structures and Algorithms"},{"key":"2015_CR24","doi-asserted-by":"crossref","unstructured":"Hastad, J. (1997). Some optimal inapproximability results. In Proceedings 29th symposium on the theory of computing (pp. 1\u201310).","DOI":"10.1145\/258533.258536"},{"issue":"3","key":"2015_CR25","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/S089547989631442X","volume":"21","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C. (2000). Fixing variables in semidefinite relaxations. SIAM Journal on Matrix Analysis and Applications, 21(3), 952\u2013969.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2015_CR26","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0377-2217(01)00143-6","volume":"137","author":"C Helmberg","year":"2002","unstructured":"Helmberg, C. (2002). Semidefinite programming. European Journal of Operational Research, 137, 461\u2013482.","journal-title":"European Journal of Operational Research"},{"key":"2015_CR27","first-page":"291","volume":"82","author":"C Helmberg","year":"1998","unstructured":"Helmberg, C., & Rendl, F. (1998). Solving quadratic (0,1)-problems by semidefinite programming and cutting planes. Mathematical Programming, 82, 291\u2013315.","journal-title":"Mathematical Programming"},{"key":"2015_CR28","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"JW Helton","year":"2010","unstructured":"Helton, J. W., & Nie, J. (2010). Semidefinite representation of convex sets. Mathematical Programming (A), 122, 21\u201364.","journal-title":"Mathematical Programming (A)"},{"key":"2015_CR29","unstructured":"Hungerl\u00e4nder, P. (2012). Semidefinite approaches to ordering problems. PhD thesis, Alpen-Adria University Klagenfurt, Austria."},{"key":"2015_CR30","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10107-012-0627-7","volume":"140","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder, P., & Rendl, F. (2013). Semidefinite relaxations of ordering problems. Mathematical Programming (B), 140, 77\u201397.","journal-title":"Mathematical Programming (B)"},{"key":"2015_CR31","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10878-005-2269-7","volume":"10","author":"G J\u00e4ger","year":"2005","unstructured":"J\u00e4ger, G., & Srivastav, A. (2005). Improved approximation algorithms for maximum graph partition problems. Journal of Combinatorial Optimization, 10, 133\u2013167.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2015_CR32","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Lee, E. K., Mutzel, P., & Odenthal, T. (1997). A polyhedral approach to the multi-layer crossing minimization problem. In GD \u201997: Proceedings of the 5th international symposium on graph drawing (pp. 13\u201324). Springer-Verlag.","DOI":"10.1007\/3-540-63938-1_46"},{"key":"2015_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., & Mutzel, P. (1997). 2-Layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications, 1, 1\u201325.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"2015_CR34","first-page":"77","volume":"18","author":"SE Karisch","year":"1998","unstructured":"Karisch, S. E., & Rendl, F. (1998). Semidefinite programming and graph equipartition. Fields Institute Communications, 18, 77\u201395.","journal-title":"Fields Institute Communications"},{"key":"2015_CR35","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computation","author":"RM Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility Among Combinatorial Problems. In R. E. Miller & J. W. Thather (Eds.), Complexity of computer computation (pp. 85\u2013103). Berlin: Plenum Press."},{"key":"2015_CR36","first-page":"155","volume":"9","author":"JM Keil","year":"1991","unstructured":"Keil, J. M., & Brecht, T. B. (1991). The complexity of clustering in planar graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 9, 155\u2013159.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"2015_CR37","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B. W., & Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49, 291\u2013307.","journal-title":"Bell System Technical Journal"},{"key":"2015_CR38","unstructured":"Khot, S. (2010). On the unique games conjecture. In Proceedings of the 25th IEEE conference on computational complexity (pp. 99\u2013121)."},{"key":"2015_CR39","volume-title":"Moments, positive polynomials and their applications","author":"JB Lasserre","year":"2010","unstructured":"Lasserre, J. B. (2010). Moments, positive polynomials and their applications. London: Imperial College Press."},{"key":"2015_CR40","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0927-0507(05)12008-8","volume-title":"Discrete Optimization","author":"M Laurent","year":"2005","unstructured":"Laurent, M., & Rendl, F. (2005). Semidefinite Programming and Integer Programming. In K. Aardal, G. L. Nemhauser, & R. Weismantel (Eds.), Discrete Optimization (pp. 393\u2013514). Amsterdam: Elsevier."},{"key":"2015_CR41","series-title":"IMA Volumes in Applied Mathematics and its Applications","volume-title":"Mixed integer nonlinear programming","year":"2012","unstructured":"Lee, J., & Leyffer, S. (Eds.). (2012). Mixed integer nonlinear programming., IMA Volumes in Applied Mathematics and its Applications Berlin: Springer."},{"key":"2015_CR42","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. (1979). On the Shannon capacity of a graph. IEEE Transaction on Information Theory, 25, 1\u20137.","journal-title":"IEEE Transaction on Information Theory"},{"key":"2015_CR43","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L. (2003). Semidefinite Programs and Combinatorial Optimization. In B. A. Reed & C. L. Sales (Eds.), Recent advances in algorithms and combinatorics (pp. 137\u2013194). Springer: CMS books in Mathematics.","DOI":"10.1007\/0-387-22444-0_6"},{"key":"2015_CR44","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. (1991). Cones of matrices and set-functions and 0\u20131 optimization. SIAM Journal on Optimization, 1, 166\u2013190.","journal-title":"SIAM Journal on Optimization"},{"key":"2015_CR45","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-012-0604-1","volume":"136","author":"J Malick","year":"2012","unstructured":"Malick, J., & Roupin, F. (2012). Solving k-cluster problems to optimality with semidefinite programming. Mathematical Programming (B), 136, 279\u2013300.","journal-title":"Mathematical Programming (B)"},{"key":"2015_CR46","series-title":"Applied Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The linear ordering problem: Exact and heuristic methods in combinatorial optimization","author":"R Marti","year":"2011","unstructured":"Marti, R., & Reinelt, G. (2011). The linear ordering problem: Exact and heuristic methods in combinatorial optimization., Applied Mathematical Sciences Springer: Berlin."},{"key":"2015_CR47","unstructured":"Nesterov, Y. (1997). Quality of semidefinite relaxation for nonconvex quadratic optimization. Technical report, CORE."},{"key":"2015_CR48","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior point polynomial algorithms in convex programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., & Nemirovski, A. S. (1994). Interior point polynomial algorithms in convex programming. Philadelphia: SIAM Publications. SIAM."},{"key":"2015_CR49","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M. (1989). The quadric Boolean polytope: Some characteristics, facets and relatives. Mathematical Programming, 45, 139\u2013172.","journal-title":"Mathematical Programming"},{"key":"2015_CR50","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P. M., & Rodgers, G. P. (1990). Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing, 45, 131\u2013144.","journal-title":"Computing"},{"key":"2015_CR51","first-page":"687","volume-title":"50 years of integer programming 1958\u20132008","author":"F Rendl","year":"2009","unstructured":"Rendl, F. (2009). Semidefinite Relaxations for Integer Programming. In M. J\u00fcnger, Th M Liebling, D. Naddef, G. L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, & L. A. Wolsey (Eds.), 50 years of integer programming 1958\u20132008 (pp. 687\u2013726). Berlin: Springer."},{"key":"2015_CR52","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10288-012-0210-3","volume":"10","author":"F Rendl","year":"2012","unstructured":"Rendl, F. (2012). Semidefinite relaxations for partitioning, assignment and ordering problems. 4OR-Quarterly Journal on Operations Research, 10, 321\u2013346.","journal-title":"4OR-Quarterly Journal on Operations Research"},{"key":"2015_CR53","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"212","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., & Wiegele, A. (2010). Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Mathematical Programming, 212, 307\u2013335.","journal-title":"Mathematical Programming"},{"key":"2015_CR54","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10107-006-0038-8","volume":"109","author":"F Rendl","year":"2007","unstructured":"Rendl, F., & Sotirov, R. (2007). Bounds for the quadratic assignment problem using the bundle method. Mathematical Programming (B), 109, 505\u2013524.","journal-title":"Mathematical Programming (B)"},{"key":"2015_CR55","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10878-004-4838-6","volume":"8","author":"F Roupin","year":"2004","unstructured":"Roupin, F. (2004). From linear to semidefinite programming: An algorithm to obtain semidefinite relaxations for bivalent quadratic problems. Journal of Combinatorial Optimization, 8, 469\u2013493.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2015_CR56","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial optimization. Polyhedra and efficiency A","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A. (2003). Combinatorial optimization. Polyhedra and efficiency A (Vol. 24)., Algorithms and Combinatorics Berlin: Springer."},{"issue":"3","key":"2015_CR57","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. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics, 3(3), 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"2015_CR58","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H. D., & Adams, W. P. (1994). A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Applied Mathematics, 52(1), 83\u2013106.","journal-title":"Discrete Applied Mathematics"},{"key":"2015_CR59","first-page":"102","volume":"5","author":"NZ Shor","year":"1987","unstructured":"Shor, N. Z. (1987). An approach to obtaining global extremums in polynomial mathematical programming problems. Kibernetika, 5, 102\u2013106.","journal-title":"Kibernetika"},{"key":"2015_CR60","series-title":"Fields Institute Monographs","doi-asserted-by":"crossref","DOI":"10.1090\/fim\/027","volume-title":"Polyhedral and semidefinite programming methods in combinatorial optimization","author":"L Tun\u00e7el","year":"2010","unstructured":"Tun\u00e7el, L. (2010). Polyhedral and semidefinite programming methods in combinatorial optimization., Fields Institute Monographs American Mathematical Society: Providence."},{"key":"2015_CR61","unstructured":"Vallentin, F. (2008). Lecture notes: semidefinite programs and harmonic analysis. Technical report, Tilburg University, Netherlands."},{"key":"2015_CR62","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., & Boyd, S. (1996). Semidefinite programming. SIAM Review, 38, 49\u201395.","journal-title":"SIAM Review"},{"key":"2015_CR63","volume-title":"Handbook of semidefinite programming","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., & Vandenberghe, L. (Eds.). (2000). Handbook of semidefinite programming. Alphen aan den Rijn: Kluwer."},{"key":"2015_CR64","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q Zhao","year":"1998","unstructured":"Zhao, Q., Karisch, S. E., Rendl, F., & Wolkowicz, H. (1998). Semidefinite programming relaxations for the quadratic assignment problem. Journal of Combinatorial Optimization, 2, 71\u2013109.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2015_CR65","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X Zhao","year":"2010","unstructured":"Zhao, X., Sun, D., & Toh, K. (2010). A Newton CG augmented Lagrangian method for semidefinite programming. SIAM Journal on Optimization, 20, 1737\u20131765.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2015-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2015-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2015-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,8]],"date-time":"2020-09-08T09:58:12Z","timestamp":1599559092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2015-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,15]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["2015"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2015-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,15]]}}}