{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:00:42Z","timestamp":1742972442955,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319328584"},{"type":"electronic","value":"9783319328591"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32859-1_45","type":"book-chapter","created":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T15:12:06Z","timestamp":1460733126000},"page":"535-549","source":"Crossref","is-referenced-by-count":0,"title":["A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Marko","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,16]]},"reference":[{"issue":"2","key":"45_CR1","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/0117041","volume":"17","author":"A Albert","year":"1969","unstructured":"Albert, A.: Conditions for positive and nonnegative definiteness in terms of pseudoinverses. SIAM J. Appl. Math. 17(2), 434\u2013440 (1969). http:\/\/dx.doi.org\/10.1137\/0117041","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"45_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2004","unstructured":"Burer, S., Monteiro, R.D.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103(3), 427\u2013444 (2004). http:\/\/dx.doi.org\/10.1007\/s10107-004-0564-1","journal-title":"Math. Program."},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Dell\u2019Amico, M., Martello, S.: Assignment Problems. SIAM Philadelphia (2012). http:\/\/dx.doi.org\/10.1137\/1.9781611972238","DOI":"10.1137\/1.9781611972238"},{"issue":"4","key":"45_CR4","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 - a quadratic assignment problem library. J. Global Optim. 10(4), 391\u2013403 (1997). http:\/\/dx.doi.org\/10.1023\/A:1008293323270","journal-title":"J. Global Optim."},{"key":"45_CR5","series-title":"Combinatorial Optimization","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E \u00c7ela","year":"1998","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Combinatorial Optimization, vol. 1. Springer, New York (1998). http:\/\/dx.doi.org\/10.1007\/978-1-4757-2787-6"},{"issue":"4","key":"45_CR6","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1287\/moor.1090.0419","volume":"34","author":"Y Ding","year":"2009","unstructured":"Ding, Y., Wolkowicz, H.: A low-dimensional semidefinite relaxation for the quadratic assignment problem. Math. Oper. Res. 34(4), 1008\u20131022 (2009). http:\/\/dx.doi.org\/10.1287\/moor.1090.0419","journal-title":"Math. Oper. Res."},{"key":"45_CR7","unstructured":"Eaton, J.W., Bateman, D., Hauberg, S.: GNU Octave version 3.0.1 manual: a high-level interactive language for numerical computations. CreateSpace Independent Publishing Platform (2009). http:\/\/www.gnu.org\/software\/octave\/doc\/interpreter"},{"key":"45_CR8","series-title":"Mathematical Programming","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BFb0120905","volume-title":"Combinatorial Optimization II","author":"CS Edwards","year":"1980","unstructured":"Edwards, C.S.: A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem. Combinatorial Optimization II. Mathematical Programming, vol. 13, pp. 35\u201352. Springer, New York (1980). http:\/\/dx.doi.org\/10.1007\/BFb0120905"},{"issue":"2","key":"45_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). http:\/\/dx.doi.org\/10.1007\/s10107-008-0246-5","journal-title":"Math. Program."},{"issue":"2","key":"45_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/ijoc.2014.0634","volume":"27","author":"E Klerk de","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). http:\/\/dx.doi.org\/10.1287\/ijoc.2014.0634","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"45_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957). http:\/\/dx.doi.org\/10.2307\/1907742","journal-title":"Econometrica"},{"key":"45_CR12","unstructured":"L\u00f6fberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference (2004). http:\/\/users.isy.liu.se\/johanl\/yalmip"},{"issue":"2","key":"45_CR13","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","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). http:\/\/dx.doi.org\/10.1016\/j.ejor.2005.09.032","journal-title":"Eur. J. Oper. Res."},{"key":"45_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534891.001.0001","volume-title":"Symmetric Functions and Hall Polynomials","author":"IG Macdonald","year":"1995","unstructured":"Macdonald, I.G.: Symmetric Functions and Hall Polynomials, 2nd edn. The Clarendon Press, Oxford University Press, New York (1995)","edition":"2"},{"issue":"6","key":"45_CR15","doi-asserted-by":"publisher","first-page":"3408","DOI":"10.1137\/090748834","volume":"20","author":"H Mittelmann","year":"2010","unstructured":"Mittelmann, H., Peng, J.: Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming. SIAM J. Optim. 20(6), 3408\u20133426 (2010). http:\/\/dx.doi.org\/10.1137\/090748834","journal-title":"SIAM J. Optim."},{"key":"45_CR16","first-page":"394","volume":"26","author":"EH Moore","year":"1920","unstructured":"Moore, E.H.: On the reciprocal of the general matrix. Bull. Am. Math. Soc. 26, 394\u2013395 (1920)","journal-title":"Bull. Am. Math. Soc."},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: a survey and recent developments. In: Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 1\u201342. American Mathematical Society (AMS) (1994)","DOI":"10.1090\/dimacs\/016\/01"},{"issue":"1","key":"45_CR18","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). http:\/\/dx.doi.org\/10.1007\/s12532-010-0012-6","journal-title":"Math. Program. Comput."},{"key":"45_CR19","doi-asserted-by":"crossref","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. (2014). http:\/\/dx.doi.org\/10.1007\/s10589-014-9663-y","DOI":"10.1007\/s10589-014-9663-y"},{"issue":"03","key":"45_CR20","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1017\/S0305004100030401","volume":"51","author":"R Penrose","year":"1955","unstructured":"Penrose, R., Todd, J.A.: A generalized inverse for matrices. Math. Proc. Camb. Phil. Soc. 51(03), 406\u2013413 (1955). http:\/\/dx.doi.org\/10.1017\/S0305004100030401","journal-title":"Math. Proc. Camb. Phil. Soc."},{"issue":"2\u20133","key":"45_CR21","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). http:\/\/dx.doi.org\/10.1007\/s10107-006-0038-8","journal-title":"Math. Program."},{"issue":"2","key":"45_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95(2), 189\u2013217 (2003). http:\/\/dx.doi.org\/10.1007\/s10107-002-0347-5","journal-title":"Math. Program."},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"Yang, L., Sun, D., Toh, K.C.: SDPnal+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. (2015). http:\/\/dx.doi.org\/10.1007\/s12532-015-0082-6","DOI":"10.1007\/s12532-015-0082-6"},{"issue":"1","key":"45_CR24","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). http:\/\/dx.doi.org\/10.1023\/A:1009795911987","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32859-1_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T20:00:07Z","timestamp":1718481607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32859-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319328584","9783319328591"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32859-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}