{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:33:59Z","timestamp":1761971639559,"version":"build-2065373602"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T00:00:00Z","timestamp":1344643200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10288-012-0210-3","type":"journal-article","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T00:37:18Z","timestamp":1344559038000},"page":"321-346","source":"Crossref","is-referenced-by-count":17,"title":["Semidefinite relaxations for partitioning, assignment and ordering problems"],"prefix":"10.1007","volume":"10","author":[{"given":"F.","family":"Rendl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,11]]},"reference":[{"key":"210_CR1","first-page":"1","volume":"1","author":"MF Anjos","year":"2005","unstructured":"Anjos MF (2005) Semidefinite optimization approaches to satisfiability and maximum-satisfiability problems. J Satisf Boolean Model Comput 1:1\u201347","journal-title":"J Satisf Boolean Model Comput"},{"volume-title":"Handbook on semidefinite, conic and polynomial optimization. International series in Operations Research and Management Science","year":"2012","key":"210_CR2","unstructured":"Anjos MF, Lasserre JB (eds) (2012) Handbook on semidefinite, conic and polynomial optimization. International series in Operations Research and Management Science. Springer, Berlin"},{"key":"210_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 MF, Kennings A, Vanelli A (2005) A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discret Optim 2:113\u2013122","journal-title":"Discret Optim"},{"key":"210_CR4","volume-title":"The traveling salesman problem. A computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate DL, Bixby RE, Chv\u00e1tal V, Cook WJ (2006) The traveling salesman problem. A computational study. Princeton University Press, Princeton"},{"key":"210_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. Math Oper Res 10: 340\u2013358","journal-title":"Math Oper Res"},{"key":"210_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. Math Program 44: 127\u2013137","journal-title":"Math Program"},{"key":"210_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. Math Program 36:157\u2013173","journal-title":"Math Program"},{"key":"210_CR8","doi-asserted-by":"crossref","unstructured":"Blekherman G, Parillo PA, Thomas R (2012) Semidefinite optimization and convex algebraic geometry. (forthcoming)","DOI":"10.1137\/1.9781611972290"},{"key":"210_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 JComput 22:168\u2013177","journal-title":"INFORMS JComput"},{"key":"210_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment problems","author":"RE Burkard","year":"2009","unstructured":"Burkard RE, Dell\u2019Amico M, Martello S (2009) Assignment problems. SIAM, Philadelphia, PA"},{"key":"210_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 & experiments [ALENEX\u20192011]","DOI":"10.1137\/1.9781611972917.12"},{"key":"210_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. Kluwer Academic Publishers, Dordrecht"},{"issue":"3","key":"210_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 DV, Warners JP (2004) On approximate graph colouring and Max- $$k$$ -Cut algorithms based on the $$\\vartheta $$ -function. J Comb Optim 8(3):267\u2013294","journal-title":"J Comb Optim"},{"issue":"1","key":"210_CR14","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 Math 79(1):71\u201375","journal-title":"Discrete Math"},{"key":"210_CR15","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. Math Program 62: 557\u2013574","journal-title":"Math Program"},{"key":"210_CR16","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01303512","volume":"13","author":"M Deza","year":"1993","unstructured":"Deza M, Grishukhin VP, Laurent M (1993) The hypermetric cone is polyhedral. Combinatorica 13:397\u2013411","journal-title":"Combinatorica"},{"key":"210_CR17","first-page":"157","volume":"38","author":"RJ Duffin","year":"1956","unstructured":"Duffin RJ (1956) Infinite programs. Ann Math Stud 38:157\u2013170","journal-title":"Ann Math Stud"},{"key":"210_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. Math Program 105:451\u2013469","journal-title":"Math Program"},{"issue":"1","key":"210_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$$ -Cut and Max Bisection. Algorithmica 18(1):67\u201381","journal-title":"Algorithmica"},{"key":"210_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 MF, Liers F (2011) A branch-and-cut algorithm based on semidefinite programming for the minimum $$k$$ -partition problem. Ann Oper Res 188:155\u2013174","journal-title":"Ann Oper Res"},{"key":"210_CR21","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42:1115\u20131145","journal-title":"J ACM"},{"issue":"2","key":"210_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 MX, Williamson DP (2004) Approximation algorithms for max-3-cut and other problems via complex semidefinite programming. J Comput Syst Sci 68(2):442\u2013470","journal-title":"J Comput Syst Sci"},{"key":"210_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 Struct Algorithms 20:382\u2013402","journal-title":"Random Struct Algorithms"},{"key":"210_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":"210_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 J Matrix Anal Appl 21(3): 952\u2013969","journal-title":"SIAM J Matrix Anal Appl"},{"key":"210_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. Eur J Oper Res 137:461\u2013482","journal-title":"Eur J Oper Res"},{"key":"210_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. Math Program 82:291\u2013315","journal-title":"Math Program"},{"key":"210_CR28","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"JW Helton","year":"2010","unstructured":"Helton JW, Nie J (2010) Semidefinite representation of convex sets. Math Program (A) 122:21\u201364","journal-title":"Math Program (A)"},{"key":"210_CR29","unstructured":"Hungerl\u00e4nder P (2012) Semidefinite approaches to ordering problems. PhD thesis, Alpen-Adria University Klagenfurt, Austria"},{"key":"210_CR30","doi-asserted-by":"crossref","unstructured":"Hungerl\u00e4nder P, Rendl F (2012) Semidefinite relaxations of ordering problems. Math Program (B), (forthcoming)","DOI":"10.1007\/s10107-012-0627-7"},{"key":"210_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. J Comb Optim 10:133\u2013167","journal-title":"J Comb Optim"},{"key":"210_CR32","doi-asserted-by":"crossref","unstructured":"J\u00fcnger M, Lee EK, 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, Berlin","DOI":"10.1007\/3-540-63938-1_46"},{"key":"210_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. J Graph Algorithms Appl 1:1\u201325","journal-title":"J Graph Algorithms Appl"},{"key":"210_CR34","first-page":"77","volume":"18","author":"SE Karisch","year":"1998","unstructured":"Karisch SE, Rendl F (1998) Semidefinite programming and graph equipartition. Fields Inst Commun 18: 77\u201395","journal-title":"Fields Inst Commun"},{"key":"210_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 RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thather JW (eds) Complexity of computer computation. Plenum Press, New York, pp 85\u2013103"},{"key":"210_CR36","first-page":"155","volume":"9","author":"JM Keil","year":"1991","unstructured":"Keil JM, Brecht TB (1991) The complexity of clustering in planar graphs. J Comb Math Comb Comput 9:155\u2013159","journal-title":"J Comb Math Comb Comput"},{"key":"210_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 BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49:291\u2013307","journal-title":"Bell Syst Tech J"},{"key":"210_CR38","doi-asserted-by":"crossref","unstructured":"Khot S (2010) On the unique games conjecture. In: Proceedings of the 25th IEEE conference on computational complexity, pp 99\u2013121","DOI":"10.1109\/CCC.2010.19"},{"key":"210_CR39","volume-title":"Moments, positive polynomials and their applications","author":"JB Lasserre","year":"2010","unstructured":"Lasserre JB (2010) Moments, positive polynomials and their applications. Imperial College Press, London"},{"key":"210_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: Aardal K, Nemhauser GL, Weismantel R (eds) Discrete optimization. Elsevier, Amsterdam, pp 393\u2013514"},{"key":"210_CR41","doi-asserted-by":"crossref","unstructured":"Lee J, Leyffer S (eds) (2012) Mixed integer nonlinear programming. IMA volumes in applied mathematics and its applications. Springer, Berlin","DOI":"10.1007\/978-1-4614-1927-3"},{"key":"210_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 Trans Inf Theory 25:1\u20137","journal-title":"IEEE Trans Inf Theory"},{"key":"210_CR43","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L (2003) Semidefinite programs and combinatorial optimization. In: Reed BA, Sales CL (eds) Recent advances in algorithms and combinatorics. CMS books in mathematics. Springer, Berlin, pp 137\u2013194","DOI":"10.1007\/0-387-22444-0_6"},{"key":"210_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 J Optim 1:166\u2013190","journal-title":"SIAM J Optim"},{"key":"210_CR45","doi-asserted-by":"crossref","unstructured":"Malick J, Roupin F (2011) Solving k-cluster problems to optimality with semidefinite programming. Technical report, CNRS, Grenoble, France","DOI":"10.1007\/s10107-012-0604-1"},{"key":"210_CR46","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. Applied Mathematical Sciences","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":"210_CR47","unstructured":"Nesterov Y (1997) Quality of semidefinite relaxation for nonconvex quadratic optimization. Technical report, CORE"},{"key":"210_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 AS (1994) Interior point polynomial algorithms in convex programming. SIAM Publications, SIAM, Philadelphia"},{"key":"210_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. Math Program 45:139\u2013172","journal-title":"Math Program"},{"key":"210_CR50","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Rodgers GP (1990) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45:131\u2013144","journal-title":"Computing"},{"key":"210_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: J\u00fcnger M, Liebling ThM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi G, Wolsey LA (eds) 50 years of integer programming 1958\u20132008. Springer, Berlin, pp 687\u2013726"},{"key":"210_CR52","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. Math Program 212:307\u2013335","journal-title":"Math Program"},{"key":"210_CR53","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. Math Program (B) 109:505\u2013524","journal-title":"Math Program (B)"},{"key":"210_CR54","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. J Comb Optim 8:469\u2013493","journal-title":"J Comb Optim"},{"key":"210_CR55","volume-title":"Combinatorial optimization. Polyhedra and efficiency A, volume 24 of algorithms and combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency A, volume 24 of algorithms and combinatorics. Springer, Berlin"},{"issue":"3","key":"210_CR56","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Discrete Math 3(3):411\u2013430","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"210_CR57","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali HD, Adams WP (1994) A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl Math 52(1):83\u2013106","journal-title":"Discrete Appl Math"},{"key":"210_CR58","first-page":"102","volume":"5","author":"NZ Shor","year":"1987","unstructured":"Shor NZ (1987) An approach to obtaining global extremums in polynomial mathematical programming problems. Kibernetika 5:102\u2013106","journal-title":"Kibernetika"},{"key":"210_CR59","doi-asserted-by":"crossref","DOI":"10.1090\/fim\/027","volume-title":"Polyhedral and semidefinite programming methods in combinatorial optimization. Fields Institute Monographs","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, RI"},{"key":"210_CR60","unstructured":"Vallentin F (2008) Lecture notes: semidefinite programs and harmonic analysis. Technical report. Tilburg University, The Netherlands"},{"key":"210_CR61","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 Rev 38:49\u201395","journal-title":"SIAM Rev"},{"volume-title":"Handbook of semidefinite programming","year":"2000","key":"210_CR62","unstructured":"Wolkowicz H, Saigal R, Vandenberghe L (eds) (2000) Handbook of semidefinite programming. Kluwer, Dordrecht"},{"key":"210_CR63","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q Zhao","year":"1998","unstructured":"Zhao Q, Karisch SE, Rendl F, Wolkowicz H (1998) Semidefinite programming relaxations for the quadratic assignment problem. J Comb Optim 2:71\u2013109","journal-title":"J Comb Optim"},{"key":"210_CR64","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 J Optim 20:1737\u20131765","journal-title":"SIAM J Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0210-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-012-0210-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0210-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T14:08:51Z","timestamp":1562076531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-012-0210-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,11]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["210"],"URL":"https:\/\/doi.org\/10.1007\/s10288-012-0210-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2012,8,11]]}}}