{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:55:20Z","timestamp":1769561720390,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T00:00:00Z","timestamp":1328572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10479-012-1079-4","type":"journal-article","created":{"date-parts":[[2012,2,6]],"date-time":"2012-02-06T09:51:40Z","timestamp":1328521900000},"page":"261-278","source":"Crossref","is-referenced-by-count":21,"title":["Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers"],"prefix":"10.1007","volume":"207","author":[{"given":"Huizhen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Cesar","family":"Beltran-Royo","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,7]]},"reference":[{"issue":"3","key":"1079_CR1","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","volume":"180","author":"W. P. Adams","year":"2007","unstructured":"Adams, W. P., Guignard, M., Hahn, P. M., & Hightower, W. L. (2007). A\u00a0level-2 reformulation-linearization technique bound for the quadratic assignment problem. European Journal of Operational Research, 180(3), 983\u2013996.","journal-title":"European Journal of Operational Research"},{"key":"1079_CR2","first-page":"43","volume-title":"DIMACS series in discrete mathematics and theoretical computer science","author":"W. P. Adams","year":"1994","unstructured":"Adams, W. P., & Johnson, T. A. (1994). Improved linear programming-based lower bounds for the quadratic assignment problem. In DIMACS series in discrete mathematics and theoretical computer science (Vol.\u00a016, pp.\u00a043\u201375), Providence: American Mathematical Society."},{"key":"1079_CR3","unstructured":"Baotic, M. (2004). Matlab interface for CPLEX, http:\/\/control.ee.ethz.ch\/~hybrid\/cplexint.php ."},{"key":"1079_CR4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/1.9780898717754.ch7","volume-title":"Assignment problems","author":"R. E. Burkard","year":"2009","unstructured":"Burkard, R. E., Dell\u2019Amico, M., & Martello, S. (2009). Assignment problems (pp.\u00a0203\u2013304). Philadelphia: SIAM."},{"issue":"4","key":"1079_CR5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R. E. Burkard","year":"1997","unstructured":"Burkard, R. E., Karisch, S. E., & Rendl, F. (1997). QAPLIB\u2014a quadratic assignment problem library. Journal of Global Optimization, 10(4), 391\u2013403. http:\/\/www.seas.upenn.edu\/qaplib\/ .","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"1079_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z. Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P. M., & Taillard, \u00c9. D. (2005). Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Annals of Operations Research, 139(1), 65\u201394.","journal-title":"Annals of Operations Research"},{"key":"1079_CR7","volume-title":"20th international symposium on fault-tolerant computing (FTCS 20)","author":"B. Eschermann","year":"1990","unstructured":"Eschermann, B., & Wunderlich, H. J. (1990). Optimized synthesis of self-testable finite state machines. In 20th international symposium on fault-tolerant computing (FTCS 20), Newcastle Upon Tyne, UK, June."},{"key":"1079_CR8","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Monaci, M., & Salvagnin, D. (2012). Three ideas for the quadratic assignment problem. Operations Research, in press.","DOI":"10.1287\/opre.1120.1073"},{"issue":"2","key":"1079_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"P. C. Gilmore","year":"1962","unstructured":"Gilmore, P. C. (1962). Optimal and suboptimal algorithms for the quadratic assignment problem. Journal of the Society for Industrial and Applied Mathematics, 10(2), 305\u2013313.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"6","key":"1079_CR10","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/opre.46.6.912","volume":"46","author":"P. Hahn","year":"1998","unstructured":"Hahn, P., & Grant, T. (1998). Lower bounds for the quadratic assignment problem based upon a dual formulation. Operations Research, 46(6), 912\u2013922.","journal-title":"Operations Research"},{"issue":"3","key":"1079_CR11","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. (1978). An algorithm for the quadratic assignment problem using Benders\u2019 decomposition. European Journal of Operational Research, 2(3), 204\u2013211.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1079_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T. C. Koopmans","year":"1957","unstructured":"Koopmans, T. C., & Beckmann, M. J. (1957). Assignment problems and the location of economic activities. Econometrica. Journal of the Econometric Society, 25(1), 53\u201376.","journal-title":"Econometrica. Journal of the Econometric Society"},{"issue":"4","key":"1079_CR13","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E. L. Lawler","year":"1963","unstructured":"Lawler, E. L. (1963). The quadratic assignment problem. Management Science, 9(4), 586\u2013599.","journal-title":"Management Science"},{"issue":"2","key":"1079_CR14","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"E. M. Loiola","year":"2007","unstructured":"Loiola, E. M., Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007). A\u00a0survey for the quadratic assignment problem. European Journal of Operational Research, 176(2), 657\u2013690.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1079_CR15","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. (2010). A\u00a0new relaxation framework for quadratic assignment problems based on matrix splitting. Mathematical Programming Computation, 2(1), 59\u201377.","journal-title":"Mathematical Programming Computation"},{"issue":"5","key":"1079_CR16","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/10556780500273077","volume":"21","author":"Y. Xia","year":"2006","unstructured":"Xia, Y., & Yuan, Y. X. (2006). A\u00a0new linearization method for quadratic assignment problems. Optimization Methods and Software, 21(5), 805\u2013818.","journal-title":"Optimization Methods and Software"},{"issue":"11","key":"1079_CR17","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.1016\/j.cor.2010.02.001","volume":"37","author":"H. Z. Zhang","year":"2010","unstructured":"Zhang, H. Z., Beltran-Royo, C., & Constantino, M. (2010). Effective formulation reductions for the quadratic assignment problem. Computers and Operations Research, 37(11), 2007\u20132016.","journal-title":"Computers and Operations Research"},{"key":"1079_CR18","unstructured":"Zhang, H. Z., Beltran-Royo, C., & Ma, L. (2010). Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers. http:\/\/www.optimization-online.org\/DB_HTML\/2010\/05\/2622.html , pp.\u00a01\u201316."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1079-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1079-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1079-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:33Z","timestamp":1559153373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1079-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,7]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["1079"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1079-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,7]]}}}