{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:08:29Z","timestamp":1746072509314,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381706"},{"type":"electronic","value":"9783642381713"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_13","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"193-203","source":"Crossref","is-referenced-by-count":2,"title":["Improved Discrete Reformulations for the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Axel","family":"Nyberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tapio","family":"Westerlund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Lundell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T. Koopmans","year":"1957","unstructured":"Koopmans, T., Beckmann, M.: Assignment problems and location of economic activities. Econometrica\u00a025, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"13_CR2","unstructured":"de Carvalho Jr., S., Rahmann, S.: Microarray layout as a quadratic assignment problem. In: Proceedings of the German Conference on Bioinformatics (GCB). Lecture Notes in Informatic, vol.\u00a0P-83, pp. 11\u201320 (2006)"},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TIT.2005.847750","volume":"51","author":"G. Ben-David","year":"2005","unstructured":"Ben-David, G., Malah, D.: Bounds on the performance of vector-quantizers under channel errors. IEEE Transactions on Information Theory\u00a051(6), 2227\u20132235 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"E. Taillard","year":"1995","unstructured":"Taillard, E.: Comparison of iterative searches for the quadratic assignment problem. Location Science\u00a03(2), 87\u2013105 (1995)","journal-title":"Location Science"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"E. Loiola","year":"2007","unstructured":"Loiola, E., Abreu, N., Boaventura-Netto, P., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. European Journal of Operational Research\u00a0176(2), 657\u2013690 (2007)","journal-title":"European Journal of Operational Research"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R. Burkard","year":"1997","unstructured":"Burkard, R., \u00c7ela, D.E., Karisch, S., Rendl, F.: QAPLIB - a quadratic assignment problem library. Journal of Global Optimization\u00a010, 391\u2013403 (1997)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ejor.2012.02.010","volume":"220","author":"A. Nyberg","year":"2012","unstructured":"Nyberg, A., Westerlund, T.: A new exact discrete linear reformulation of the quadratic assignment problem. European Journal of Operational Research\u00a0220(2), 314\u2013319 (2012)","journal-title":"European Journal of Operational Research"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Eschermann, B., Wunderlich, H.J.: Optimized synthesis of self-testable finite state machines. In: 20th International Symposium on Fault-Tolerant Computing, FTCS-20. Digest of Papers, pp. 390\u2013397 (June 1990)","DOI":"10.1109\/FTCS.1990.89393"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1287\/opre.1120.1073","volume":"60","author":"M. Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M., Salvagnin, D.: Three ideas for the quadratic assignment problem. Operations Research\u00a060, 954\u2013964 (2012)","journal-title":"Operations Research"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem Theory and Algorithms. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4757-2787-6"},{"issue":"12","key":"13_CR11","doi-asserted-by":"publisher","first-page":"5742","DOI":"10.1021\/ie8016048","volume":"48","author":"C.E. Gounaris","year":"2009","unstructured":"Gounaris, C.E., Misener, R., Floudas, C.A.: Computational comparison of piecewise linear relaxations for pooling problems. Industrial & Engineering Chemistry Research\u00a048(12), 5742\u20135766 (2009)","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J. Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Mathematical Programming\u00a0126, 147\u2013178 (2011), doi:10.1007\/s10107-009-0273-x","journal-title":"Mathematical Programming"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"P.C. Gilmore","year":"1962","unstructured":"Gilmore, P.C.: Optimal and suboptimal algorithms for the quadratic assignment problem. Journal of the Society for Industrial and Applied Mathematics\u00a010, 305\u2013313 (1962)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38171-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:07:23Z","timestamp":1745986043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}