{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T09:07:29Z","timestamp":1749114449081,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000057","name":"National Institute of General Medical Sciences","doi-asserted-by":"crossref","award":["R01GM090200"],"award-info":[{"award-number":["R01GM090200"]}],"id":[{"id":"10.13039\/100000057","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0317"],"award-info":[{"award-number":["FA9550-12-1-0317"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000936","name":"Gordon and Betty Moore Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000936","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10589-017-9968-8","type":"journal-article","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T15:18:02Z","timestamp":1510931882000},"page":"677-712","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Semidefinite programming approach for the quadratic assignment problem with a sparse graph"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3713-7759","authenticated-orcid":false,"given":"Jos\u00e9 F. S.","family":"Bravo Ferreira","sequence":"first","affiliation":[]},{"given":"Yuehaw","family":"Khoo","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"key":"9968_CR1","doi-asserted-by":"publisher","unstructured":"Aflalo, Y., Bronstein, A., Kimmel, R.: On convex relaxation of graph isomorphism. Proc. Natl. Acad. Sci. 112(10), 2942\u20132947 (2015). \n                    https:\/\/doi.org\/10.1073\/pnas.1401651112\n                    \n                  . \n                    http:\/\/www.pnas.org\/content\/112\/10\/2942.abstract","DOI":"10.1073\/pnas.1401651112"},{"issue":"1","key":"9968_CR2","first-page":"15","volume":"9","author":"B Alipanahi","year":"2011","unstructured":"Alipanahi, B., Gao, X., Karakoc, E., Li, S., Balbach, F., Feng, G., Donaldson, L., Li, M.: Error tolerant nmr backbone resonance assignment and automated structure generation. J. Biomol. NMR 9(1), 15\u201341 (2011)","journal-title":"J. Biomol. NMR"},{"issue":"5","key":"9968_CR3","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/34.211474","volume":"15","author":"H Almohamad","year":"1993","unstructured":"Almohamad, H., Duffuaa, S.O.: A linear programming approach for the weighted graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 15(5), 522\u2013525 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9968_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. ArXiv e-prints (2015)","DOI":"10.1145\/2897518.2897542"},{"issue":"4","key":"9968_CR5","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 problemlibrary. J. Glob. Optim. 10(4), 391\u2013403 (1997). \n                    https:\/\/doi.org\/10.1023\/A:1008293323270","journal-title":"J. Glob. Optim."},{"issue":"6","key":"9968_CR6","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1109\/TCBB.2012.122","volume":"9","author":"G Cavuslar","year":"2012","unstructured":"Cavuslar, G., Catay, B., Apaydin, M.S.: A tabu search approach for the nmr protein structure-based assignment problem. IEEE\/ACM Trans. Comput. Biol. Bioinform. 9(6), 1621\u20131628 (2012). \n                    https:\/\/doi.org\/10.1109\/TCBB.2012.122","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1\u20132","key":"9968_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"C Chen","year":"2016","unstructured":"Chen, C., He, B., Ye, Y., Yuan, X.: The direct extension of admm for multi-block convex minimization problems is not necessarily convergent. Math. Program. 155(1\u20132), 57\u201379 (2016). \n                    https:\/\/doi.org\/10.1007\/s10107-014-0826-5","journal-title":"Math. Program."},{"issue":"1\u20132","key":"9968_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D., Toh, K.C.: An efficient inexact symmetric gauss\u2013seidel based majorized admm for high-dimensional convex composite conic programming. Math. Program. 161(1\u20132), 237\u2013270 (2017). \n                    https:\/\/doi.org\/10.1007\/s10107-016-1007-5","journal-title":"Math. Program."},{"key":"9968_CR9","unstructured":"Christofides, N., Benavent, E.: An exact algorithm for the quadratic assignment problem on a tree. Oper. Res. 37(5), 760\u2013768 (1989). \n                    http:\/\/www.jstor.org\/stable\/171021"},{"issue":"2","key":"9968_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-008-0246-5","volume":"122","author":"E de Klerk","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). \n                    https:\/\/doi.org\/10.1007\/s10107-008-0246-5","journal-title":"Math. Program."},{"issue":"2","key":"9968_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/ijoc.2014.0634","volume":"27","author":"E de Klerk","year":"2015","unstructured":"de Klerk, E., Sotirov, R., Truetsch, U.: A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives. INFORMS J. Comput. 27(2), 378\u2013391 (2015). \n                    https:\/\/doi.org\/10.1287\/ijoc.2014.0634","journal-title":"INFORMS J. Comput."},{"key":"9968_CR12","doi-asserted-by":"publisher","unstructured":"Dufoss, F., Uar, B.: Notes on birkhoffvon neumann decomposition of doubly stochastic matrices. Linear Algebra Appl. 497, 108\u2013115 (2016). \n                    https:\/\/doi.org\/10.1016\/j.laa.2016.02.023\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379516001257","DOI":"10.1016\/j.laa.2016.02.023"},{"issue":"3","key":"9968_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10858-005-7944-6","volume":"32","author":"HR Eghbalnia","year":"2005","unstructured":"Eghbalnia, H.R., Bahrami, A., Wang, L., Assadi, A., Markley, J.L.: Probabilistic identification of spin systems and their assignments including coil-helix inference as output (pistachio). J. Biomol. NMR 32(3), 219\u2013233 (2005). \n                    https:\/\/doi.org\/10.1007\/s10858-005-7944-6","journal-title":"J. Biomol. NMR"},{"key":"9968_CR14","unstructured":"Elias Oliveira, D., Wolkowicz, H., Xu, Y.: ADMM for the SDP relaxation of the QAP. ArXiv e-prints (2015)"},{"key":"9968_CR15","doi-asserted-by":"publisher","unstructured":"Eschermann, B., Wunderlich, H.J.: Optimized synthesis of self-testable finite state machines. In: Fault-Tolerant Computing, 1990. FTCS-20. Digest of Papers., 20th International Symposium, pp. 390\u2013397 (1990). \n                    https:\/\/doi.org\/10.1109\/FTCS.1990.89393","DOI":"10.1109\/FTCS.1990.89393"},{"key":"9968_CR16","unstructured":"Genton, M.G.: Classes of kernels for machine learning: A statistics perspective. J. Mach. Learn. Res. 2, 299\u2013312 (2002). \n                    http:\/\/dl.acm.org\/citation.cfm?id=944790.944815"},{"issue":"1","key":"9968_CR17","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/B:JNMR.0000042954.99056.ad","volume":"30","author":"YS Jung","year":"2004","unstructured":"Jung, Y.S., Zweckstetter, M.: Mars\u2014robust automatic backbone assignment of proteins. J. Biomol. NMR 30(1), 11\u201323 (2004). \n                    https:\/\/doi.org\/10.1023\/B:JNMR.0000042954.99056.ad","journal-title":"J. Biomol. NMR"},{"key":"9968_CR18","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12701","author":"I Kezurer","year":"2015","unstructured":"Kezurer, I., Kovalsky, S.Z., Basri, R., Lipman, Y.: Tight relaxation of quadratic matching. Comput. Gr. Forum (2015). \n                    https:\/\/doi.org\/10.1111\/cgf.12701","journal-title":"Comput. Gr. Forum"},{"key":"9968_CR19","unstructured":"Koopmans, T., Beckmann, M.J.: Assignment problems and the location of economic activities. Cowles Foundation Discussion Papers\u00a04, Cowles Foundation for Research in Economics, Yale University (1955). \n                    http:\/\/EconPapers.repec.org\/RePEc:cwl:cwldpp:4"},{"issue":"1\u20132","key":"9968_CR20","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10107-014-0850-5","volume":"155","author":"X Li","year":"2016","unstructured":"Li, X., Sun, D., Toh, K.C.: A schur complement based semi-proximal admm for convex quadratic conic programming and extensions. Math. Program. 155(1\u20132), 333\u2013373 (2016). \n                    https:\/\/doi.org\/10.1007\/s10107-014-0850-5","journal-title":"Math. Program."},{"key":"9968_CR21","doi-asserted-by":"publisher","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2005.09.032\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221705008337","DOI":"10.1016\/j.ejor.2005.09.032"},{"issue":"1","key":"9968_CR22","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/TPAMI.2015.2424894","volume":"38","author":"V Lyzinski","year":"2016","unstructured":"Lyzinski, V., Fishkind, D.E., Fiori, M., Vogelstein, J.T., Priebe, C.E., Sapiro, G.: Graph matching: relax at your own risk. IEEE Trans. Pattern Anal. Mach. Intell. 38(1), 60 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"9968_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s12532-010-0012-6","volume":"2","author":"J Peng","year":"2010","unstructured":"Peng, J., Mittelmann, H., Li, X.: A new relaxation framework for quadratic assignment problems based on matrix splitting. Math. Program. Comput. 2(1), 59\u201377 (2010). \n                    https:\/\/doi.org\/10.1007\/s12532-010-0012-6","journal-title":"Math. Program. Comput."},{"issue":"1","key":"9968_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10589-014-9663-y","volume":"60","author":"J Peng","year":"2015","unstructured":"Peng, J., Zhu, T., Luo, H., Toh, K.C.: Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting. Comput. Optim. Appl. 60(1), 171\u2013198 (2015). \n                    https:\/\/doi.org\/10.1007\/s10589-014-9663-y","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20133","key":"9968_CR25","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(94)90241-0","volume":"132","author":"MV Ramana","year":"1994","unstructured":"Ramana, M.V., Scheinerman, E.R., Ullman, D.: Fractional isomorphism of graphs. Discrete Math. 132(1\u20133), 247\u2013265 (1994)","journal-title":"Discrete Math."},{"issue":"3","key":"9968_CR26","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976). \n                    https:\/\/doi.org\/10.1145\/321958.321975.","journal-title":"J. ACM"},{"issue":"1\u20134","key":"9968_CR27","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999). \n                    https:\/\/doi.org\/10.1080\/10556789908805766","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9968_CR28","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/140964357","volume":"25","author":"D Sun","year":"2015","unstructured":"Sun, D., Toh, K.C., Yang, L.: A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints. SIAM J. Optim. 25(2), 882\u2013915 (2015). \n                    https:\/\/doi.org\/10.1137\/140964357","journal-title":"SIAM J. Optim."},{"key":"9968_CR29","doi-asserted-by":"publisher","unstructured":"Ulrich, E.L., Akutsu, H., Doreleijers, J.F., Harano, Y., Ioannidis, Y.E., Lin, J., Livny, M., Mading, S., Maziuk, D., Miller, Z., Nakatani, E., Schulte, C.F., Tolmie, D.E., Kent Wenger, R., Yao, H., Markley, J.L.: BioMagResBank. Nucleic Acids Res. 36(suppl 1), D402\u2013D408 (2008). \n                    https:\/\/doi.org\/10.1093\/nar\/gkm957\n                    \n                  . \n                    http:\/\/nar.oxfordjournals.org\/content\/36\/suppl_1\/D402.abstract","DOI":"10.1093\/nar\/gkm957"},{"issue":"3","key":"9968_CR30","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/tcbb.2007.1047","volume":"4","author":"X Wan","year":"2007","unstructured":"Wan, X., Lin, G.: CISA: Combined NMR resonance connectivity information determination and sequential assignment. IEEE\/ACM Trans. Comput. Biol. Bioinf. 4(3), 336\u2013348 (2007). \n                    https:\/\/doi.org\/10.1109\/tcbb.2007.1047","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"9968_CR31","doi-asserted-by":"publisher","unstructured":"Wuthrich, K., Wider, G., Wagner, G., Braun, W.: Sequential resonance assignments as a basis for determination of spatial protein structures by high resolution proton nuclear magnetic resonance. J. Mol. Biol. 155(3), 311\u2013319 (1982). \n                    https:\/\/doi.org\/10.1016\/0022-2836(82)90007-9\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/0022283682900079","DOI":"10.1016\/0022-2836(82)90007-9"},{"issue":"12","key":"9968_CR32","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., Vert, J.P.: A path following algorithm for the graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 31(12), 2227\u20132242 (2009). \n                    https:\/\/doi.org\/10.1109\/TPAMI.2008.245","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"9968_CR33","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q Zhao","year":"1998","unstructured":"Zhao, Q., Karisch, S., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Comb. Optim. 2(1), 71\u2013109 (1998). \n                    https:\/\/doi.org\/10.1023\/A:1009795911987","journal-title":"J. Comb. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9968-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9968-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9968-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:56:44Z","timestamp":1589713004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9968-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,17]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9968"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9968-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2017,11,17]]},"assertion":[{"value":"27 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}