{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:52:49Z","timestamp":1725864769798},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319455860"},{"type":"electronic","value":"9783319455877"}],"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-45587-7_36","type":"book-chapter","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T04:01:21Z","timestamp":1473393681000},"page":"414-425","source":"Crossref","is-referenced-by-count":1,"title":["A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases"],"prefix":"10.1007","author":[{"given":"Maximilian","family":"John","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Karrenbauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"36_CR1","first-page":"147","volume":"5","author":"D Birkhoff","year":"1946","unstructured":"Birkhoff, D.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman Rev. Ser. A 5, 147\u2013151 (1946)","journal-title":"Univ. Nac. Tucuman Rev. Ser. A"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Res. Logistics Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logistics Q."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Duan, R., Su, H.H.: A scaling algorithm for maximum weight matching in bipartite graphs. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1413\u20131424. SIAM (2012)","DOI":"10.1137\/1.9781611973099.111"},{"key":"36_CR4","unstructured":"Koopmans, T., Beckmann, M.J.: Assignment problems and the location of economic activities. Cowles Foundation Discussion Papers 4, Cowles Foundation for Research in Economics, Yale University (1955)"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C Nugent","year":"1968","unstructured":"Nugent, C., Vollman, T., Ruml, J.: An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 16, 150\u2013173 (1968)","journal-title":"Oper. Res."},{"key":"36_CR6","first-page":"121","volume":"21","author":"R Burkard","year":"1977","unstructured":"Burkard, R., Offermann, J.: Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. Z. Oper. Res. 21, 121\u2013132 (1977)","journal-title":"Z. Oper. Res."},{"key":"36_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0303-9_27","volume-title":"The Quadratic Assignment Problem","author":"RE Burkard","year":"1998","unstructured":"Burkard, R.E., \u00c7ela, E., Pardalos, P.M., Pitsoulis, L.S.: The Quadratic Assignment Problem. Springer, Heidelberg (1998)"},{"key":"36_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1003003","volume":"3","author":"L Steinberg","year":"1961","unstructured":"Steinberg, L.: The backboard wiring problem: a placement algorithm. SIAM Rev. 3, 37\u201350 (1961)","journal-title":"SIAM Rev."},{"key":"36_CR9","series-title":"Mathematical Programming Studies","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume-title":"Mathematical Programming in Use","author":"J Krarup","year":"1978","unstructured":"Krarup, J., Pruzan, P.M.: Computer-aided layout design. In: Balinski, M.L., Lemarechal, C. (eds.) Mathematical Programming in Use. Mathematical Programming Studies, vol. 9, pp. 75\u201394. Springer, Heidelberg (1978)"},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.2307\/3008789","volume":"28","author":"AN Elshafei","year":"1977","unstructured":"Elshafei, A.N.: Hospital layout as a quadratic assignment problem. Oper. Res. Q. (1970\u20131977) 28, 167\u2013179 (1977)","journal-title":"Oper. Res. Q. (1970\u20131977)"},{"key":"36_CR11","doi-asserted-by":"crossref","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 problemlibrary. J. Glob. Optim. 10, 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"key":"36_CR12","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s101070100255","volume":"91","author":"K Anstreicher","year":"2014","unstructured":"Anstreicher, K., Brixius, N., Goux, J.P., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Math. Program. 91, 563\u2013588 (2014)","journal-title":"Math. Program."},{"key":"36_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6377(86)90007-6","volume":"4","author":"M Queyranne","year":"1986","unstructured":"Queyranne, M.: Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. Oper. Res. Lett. 4, 231\u2013234 (1986)","journal-title":"Oper. Res. Lett."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: a survey and recent developments. In: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 1\u201342. American Mathematical Society (1994)","DOI":"10.1090\/dimacs\/016\/01"},{"key":"36_CR15","first-page":"1","volume":"4","author":"CW Commander","year":"2005","unstructured":"Commander, C.W.: A survey of the quadratic assignment problem, with applications. Morehead Electron. J. Appl. Math. 4, 1\u201315 (2005). MATH-2005-01","journal-title":"Morehead Electron. J. Appl. Math."},{"key":"36_CR16","doi-asserted-by":"crossref","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, 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"PC Gilmore","year":"1962","unstructured":"Gilmore, P.C.: Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J. Appl. Math. 10, 305\u2013313 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"36_CR18","doi-asserted-by":"crossref","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. Manage. Sci. 9, 586\u2013599 (1963)","journal-title":"Manage. Sci."},{"key":"36_CR19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02085649","volume":"50","author":"Y Li","year":"1994","unstructured":"Li, Y., Pardalos, P.M., Ramakrishnan, K.G., Resende, M.G.C.: Lower bounds for the quadratic assignment problem. Ann. Oper. Res. 50, 387\u2013410 (1994)","journal-title":"Ann. Oper. Res."},{"key":"36_CR20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0166-218X(83)90018-5","volume":"5","author":"A Frieze","year":"1983","unstructured":"Frieze, A., Yadegar, J.: On the quadratic assignment problem. Discrete Appl. Math. 5, 89\u201398 (1983)","journal-title":"Discrete Appl. Math."},{"key":"36_CR21","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0377-2217(78)90095-4","volume":"2","author":"L Kaufman","year":"1978","unstructured":"Kaufman, L., Broeckx, F.: An algorithm for the quadratic assignment problem using Benders\u2019 decomposition. Eur. J. Oper. Res. 2, 204\u2013211 (1978)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR22","doi-asserted-by":"crossref","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, 71\u2013109 (1998)","journal-title":"J. Comb. Optim."},{"key":"36_CR23","doi-asserted-by":"crossref","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, 231\u2013241 (2009)","journal-title":"Discret. Optim."},{"key":"36_CR24","doi-asserted-by":"crossref","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, 59\u201377 (2010)","journal-title":"Math. Program. Comput."},{"key":"36_CR25","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1998). A Wiley-Interscience Publication"},{"key":"36_CR26","unstructured":"ApS, M.: The MOSEK C optimizer API manual Version 7.1 (Revision 52) (2016)"},{"key":"36_CR27","unstructured":"Gurobi Optimization, I.: Gurobi optimizer reference manual (2016)"},{"key":"36_CR28","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2008","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121, 307\u2013335 (2008)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45587-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:18:26Z","timestamp":1498342706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45587-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319455860","9783319455877"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45587-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}