{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T08:29:22Z","timestamp":1721550562970},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T00:00:00Z","timestamp":1223337600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10107-008-0246-5","type":"journal-article","created":{"date-parts":[[2008,10,6]],"date-time":"2008-10-06T14:58:50Z","timestamp":1223305130000},"source":"Crossref","is-referenced-by-count":65,"title":["Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem"],"prefix":"10.1007","volume":"122","author":[{"given":"Etienne","family":"de Klerk","sequence":"first","affiliation":[]},{"given":"Renata","family":"Sotirov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,7]]},"reference":[{"key":"246_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","volume":"97","author":"K.M. Anstreicher","year":"2003","unstructured":"Anstreicher K.M.: Recent advances in the solution of quadratic assignment problems. Math. Program. Ser. B 97, 27\u201342 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"246_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s101070100255","volume":"91","author":"K.M. Anstreicher","year":"2002","unstructured":"Anstreicher K.M., Brixius N., Linderoth J., Goux J.-P.: Solving large quadratic assignment problems on computational grids. Math. Program. Ser. B 91, 563\u2013588 (2002)","journal-title":"Math. Program. Ser. B"},{"issue":"1\u20134","key":"246_CR3","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11\/12","author":"B. Borchers","year":"1999","unstructured":"Borchers B.: CSDP, a C library for semidefinite programming. Optim. Meth. Softw. 11\/12(1\u20134), 613\u2013623 (1999)","journal-title":"Optim. Meth. Softw."},{"key":"246_CR4","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1137\/040609574","volume":"16","author":"S. Burer","year":"2006","unstructured":"Burer S., Vandenbussche D.: Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16, 726\u2013750 (2006)","journal-title":"SIAM J. Optim."},{"key":"246_CR5","doi-asserted-by":"crossref","unstructured":"Eschermann, B., Wunderlich, H.J.: Optimized synthesis of self-testable finite state machines. In: 20th International Symposium on Fault-tolerant Computing (FFTCS 20), Newcastle upon Tyne, 26\u201328 June 1990","DOI":"10.1109\/FTCS.1990.89393"},{"key":"246_CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB\u2014a quadratic assignment problem library. J. Global Optim. 10, 291\u2013403 (1997); see also \n http:\/\/www.seas.upenn.edu\/qaplib\/","journal-title":"J. Global Optim."},{"key":"246_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/S0895480104442741","volume":"20","author":"E. Klerk de","year":"2006","unstructured":"Klerk E., Maharry J., Pasechnik D.V., Richter B., Salazar G.: Improved bounds for the crossing numbers of K\n \n m,n\n and K\n \n n\n . SIAM J. Discr. Math. 20, 189\u2013202 (2006)","journal-title":"SIAM J. Discr. Math."},{"issue":"2\u20133","key":"246_CR8","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10107-006-0039-7","volume":"109","author":"E. Klerk de","year":"2007","unstructured":"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"},{"key":"246_CR9","unstructured":"de Klerk, E., Pasechnik, D.V., Sotirov, R.: On semidefinite programming relaxations of the traveling salesman problem. CentER discussion paper 2007-101, Tilburg University, The Netherlands (2007). Available at: \n http:\/\/arno.uvt.nl\/show.cgi?fid=67481"},{"key":"246_CR10","unstructured":"GAP\u2014groups, algorithms, and programming, Version 4.4.9, The GAP group (2006) \n http:\/\/www.gap-system.org"},{"key":"246_CR11","doi-asserted-by":"publisher","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 sum of squares. J. Pure Appl. Algebra 192, 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"key":"246_CR12","unstructured":"Gijswijt, D.: Matrix algebras and semidefinite programming techniques for codes. PhD Thesis, University of Amsterdam, The Netherlands (2005). \n http:\/\/staff.science.uva.nl\/~gijswijt\/promotie\/thesis.pdf"},{"key":"246_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"P.C. Gilmore","year":"1962","unstructured":"Gilmore P.C.: Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J. Appl. Math. 10, 305\u201331 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"246_CR14","volume-title":"Kronecker products and matrix calculus with applications","author":"A. Graham","year":"1981","unstructured":"Graham A.: Kronecker products and matrix calculus with applications. Ellis Horwood Limited, Chichester (1981)"},{"key":"246_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R. Grone","year":"1984","unstructured":"Grone R., Johnson C.R., S\u00e1 E.M., Wolkowicz H.: Positive definite completions of partial Hermitian matrices. Lin. Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Lin. Algebra Appl."},{"key":"246_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E. Lawler","year":"1963","unstructured":"Lawler E.: The quadratic assignment problem. Manage. Sci. 9, 586\u2013599 (1963)","journal-title":"Manage. Sci."},{"issue":"2","key":"246_CR17","doi-asserted-by":"publisher","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."},{"key":"246_CR18","unstructured":"Peng, J., Mittelmann, H., Wu, X.: Graph modeling for quadratic assignment problem associated with the hypercube. Technical report, Department of IESE, UIUC, Urbana, IL, 61801, USA (2007). Available at Optimization Online"},{"key":"246_CR19","unstructured":"Povh, J., Rendl, F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Manuscript (2006). \n http:\/\/www.optimization-online.org\/DB_HTML\/2006\/10\/1502.html"},{"issue":"2\u20133","key":"246_CR20","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10107-006-0038-8","volume":"109","author":"F. Rendl","year":"2007","unstructured":"Rendl F., Sotirov R.: Bounds for the quadratic assignment problem using the bundle method. Math Program Ser B 109(2\u20133), 505\u2013524 (2007)","journal-title":"Math Program Ser B"},{"key":"246_CR21","doi-asserted-by":"publisher","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":"246_CR22","doi-asserted-by":"publisher","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"},{"key":"246_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9458-7","volume-title":"Linear representations of finite groups. Graduate texts in mathematics, vol. 42","author":"J.-P. Serre","year":"1977","unstructured":"Serre J.-P.: Linear representations of finite groups. Graduate texts in mathematics, vol. 42. Springer, New York (1977)"},{"key":"246_CR24","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"J.F. Sturm","year":"1999","unstructured":"Sturm J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Meth. Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Meth. Softw."},{"issue":"2","key":"246_CR25","first-page":"77","volume":"6","author":"J.H.M. Wedderburn","year":"1907","unstructured":"Wedderburn J.H.M.: On hypercomplex numbers. Proc. Lond. Math. Soc. 6(2), 77\u2013118 (1907)","journal-title":"Proc. Lond. Math. Soc."},{"key":"246_CR26","doi-asserted-by":"crossref","unstructured":"Wedderburn, J.H.M.: Lectures on matrices. AMS Colloquium Publications, vol. 17. AMS publishers (1934)","DOI":"10.1090\/coll\/017"},{"key":"246_CR27","unstructured":"L\u00f6fberg, J.: YALMIP : A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD conference, Taipei, Taiwan (2004). \n http:\/\/control.ee.ethz.ch\/~joloef\/yalmip.php"},{"key":"246_CR28","doi-asserted-by":"publisher","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.: Semidefinite programming relaxations for the quadratic assignment problem. J. Combin. Optim. 2, 71\u2013109 (1998)","journal-title":"J. Combin. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0246-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0246-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0246-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0246-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T15:50:54Z","timestamp":1548172254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0246-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,7]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["246"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0246-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,7]]},"article-number":"225"}}