{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:24:14Z","timestamp":1774308254646,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T00:00:00Z","timestamp":1537401600000},"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. Prog. Comp."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s12532-018-0148-3","type":"journal-article","created":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T04:42:48Z","timestamp":1537418568000},"page":"631-658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["ADMM for the SDP relaxation of the QAP"],"prefix":"10.1007","volume":"10","author":[{"given":"Danilo Elias","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"Henry","family":"Wolkowicz","sequence":"additional","affiliation":[]},{"given":"Yangyang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"1\u20132","key":"148_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","volume":"97","author":"KM Anstreicher","year":"2003","unstructured":"Anstreicher, K.M.: Recent advances in the solution of quadratic assignment problems. Math. Program. 97(1\u20132), 27\u201342 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"148_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/PL00011402","volume":"89","author":"KM Anstreicher","year":"2001","unstructured":"Anstreicher, K.M., Brixius, N.W.: A new bound for the quadratic assignment problem based on convex quadratic programming. Math. Program. 89(3), 341\u2013357 (2001)","journal-title":"Math. Program."},{"issue":"9","key":"148_CR3","first-page":"42","volume":"96","author":"RK Bhati","year":"2014","unstructured":"Bhati, R.K., Rasool, A.: Quadratic assignment problem and its relevance to the real world: a survey. Int. J. Comput. Appl. 96(9), 42\u201347 (2014)","journal-title":"Int. J. Comput. Appl."},{"key":"148_CR4","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff, G.: Three observations on linear algebra. Univ. Nac. Tucum\u00e1n. Revista A 5, 147\u2013151 (1946)","journal-title":"Univ. Nac. Tucum\u00e1n. Revista A"},{"issue":"1","key":"148_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"3","key":"148_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., Monteiro, R.D.C.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103(3), 427\u2013444 (2005)","journal-title":"Math. Program."},{"key":"148_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"RE Burkard","year":"1991","unstructured":"Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB\u2013a quadratic assignment problem library. Eur. J. Oper. Res. 55, 115\u2013119 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"148_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB\u2013a quadratic assignment problem library. J. Global Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Global Optim."},{"issue":"2","key":"148_CR9","doi-asserted-by":"publisher","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. 122(2), 225\u2013246 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"148_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrica 1(3), 211\u2013218 (1936)","journal-title":"Psychometrica"},{"key":"148_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BFb0120905","volume":"13","author":"CS Edwards","year":"1980","unstructured":"Edwards, C.S.: A branch and bound algorithm for the Koopmans\u2013Beckmann quadratic assignment problem. Math. Program. Study 13, 35\u201352 (1980)","journal-title":"Math. Program. Study"},{"issue":"1","key":"148_CR12","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/S1064827500382579","volume":"24","author":"GH Golub","year":"2002","unstructured":"Golub, G.H., Ye, Q.: An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. SIAM J. Sci. Comput. 24(1), 312\u2013334 (2002). (electronic)","journal-title":"SIAM J. Sci. Comput."},{"key":"148_CR13","unstructured":"Ito, N., Kim, S., Kojima, M., Takeda, A., Toh, K.C.: Bbcpop: a sparse doubly nonnegative relaxation of polynomial optimization problems with binary, box and complementarity constraints. arXiv preprint \n                    arXiv:1804.00761\n                    \n                   (2018)"},{"key":"148_CR14","doi-asserted-by":"crossref","unstructured":"Jain, R., Yao, P.: A parallel approximation algorithm for positive semidefinite programming. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science\u2014FOCS 2011, pp. 463\u2013471. IEEE Computer Soc., Los Alamitos, CA (2011)","DOI":"10.1109\/FOCS.2011.25"},{"issue":"4","key":"148_CR15","doi-asserted-by":"publisher","first-page":"2284","DOI":"10.1137\/15M1048021","volume":"26","author":"Bo Jiang","year":"2016","unstructured":"Jiang, Bo, Liu, Ya-Feng, Wen, Zaiwen: \n                    \n                      \n                    \n                    $$l_p$$\n                    \n                      \n                        \n                          l\n                          p\n                        \n                      \n                    \n                  -norm regularization algorithms for optimization over permutation matrices. SIAM J. Optim. 26(4), 2284\u20132313 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"148_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10107-015-0874-5","volume":"156","author":"S Kim","year":"2016","unstructured":"Kim, S., Kojima, M., Toh, K.-C.: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math. Program. 156(1\u20132), 161\u2013187 (2016)","journal-title":"Math. Program."},{"key":"148_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"148_CR18","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler, E.L.: The quadratic assignment problem. Manag. Sci. 9, 586\u2013599 (1963)","journal-title":"Manag. Sci."},{"key":"148_CR19","unstructured":"Liao, Z.: Branch and bound via ADMM for the quadratic assignment problem. Master\u2019s thesis, University of Waterloo (2016)"},{"key":"148_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/dimacs\/016","volume-title":"Quadratic Assignment and Related Problems (New Brunswick, NJ, 1993)","author":"P Pardalos","year":"1994","unstructured":"Pardalos, P., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: a survey and recent developments. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems (New Brunswick, NJ, 1993), pp. 1\u201342. American Mathematical Society, Providence, RI (1994)"},{"key":"148_CR21","unstructured":"Pardalos, P., Wolkowicz, H. (eds.).: Quadratic assignment and related problems. American Mathematical Society, Providence, RI, 1994. Papers from the workshop held at Rutgers University, New Brunswick, New Jersey, May 20\u201321 (1993)"},{"issue":"2","key":"148_CR22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10589-015-9779-8","volume":"63","author":"TK Pong","year":"2016","unstructured":"Pong, T.K., Sun, H., Wang, N., Wolkowicz, H.: Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem. Comput. Optim. Appl. 63(2), 333\u2013364 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"148_CR23","doi-asserted-by":"publisher","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. Discret. Optim. 6(3), 231\u2013241 (2009)","journal-title":"Discret. Optim."},{"issue":"2\u20133","key":"148_CR24","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. 109(2\u20133), 505\u2013524 (2007)","journal-title":"Math. Program."},{"issue":"1\u20134","key":"148_CR25","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2014a MATLAB software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"3\u20134","key":"148_CR26","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3\u20134), 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"148_CR27","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"L Yang","year":"2015","unstructured":"Yang, L., Sun, D., Toh, K.-C.: \n                    \n                      \n                    \n                    $${\\rm SDPNAL}+$$\n                    \n                      \n                        \n                          SDPNAL\n                          +\n                        \n                      \n                    \n                  : a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7(3), 331\u2013366 (2015)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"148_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. Comb. Optim. 2(1), 71\u2013109 (1998)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"148_CR29","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D., Toh, K.C.: A Newton-CG augmented lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-018-0148-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0148-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0148-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T23:14:42Z","timestamp":1568934882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-018-0148-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,20]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1007\/s12532-018-0148-3","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,20]]},"assertion":[{"value":"15 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}