{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:31:34Z","timestamp":1648618294464},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T00:00:00Z","timestamp":1527120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10100-018-0552-9","type":"journal-article","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T07:50:06Z","timestamp":1527148206000},"page":"475-482","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Integrating combinatorial algorithms into a linear programming solver"],"prefix":"10.1007","volume":"27","author":[{"given":"Rich\u00e1rd","family":"Moln\u00e1r-Szipai","sequence":"first","affiliation":[]},{"given":"Anita","family":"Varga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,24]]},"reference":[{"issue":"3","key":"552_CR1","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","volume":"180","author":"WP Adams","year":"2007","unstructured":"Adams WP, Guignard M, Hahn PM, Hightower WL (2007) A level-2 reformulation linearization technique bound for the quadratic assignment problem. Eur J Oper Res 180(3):983\u2013996. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2006.03.051","journal-title":"Eur J Oper Res"},{"key":"552_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1090\/dimacs\/016\/02","volume":"16","author":"WP Adams","year":"1994","unstructured":"Adams WP, Johnson TA (1994) Improved linear programming-based lower bounds for the quadratic assignment problem. DIMACS Ser Discrete Math Theor Comput Sci 16:43\u201375","journal-title":"DIMACS Ser Discrete Math Theor Comput Sci"},{"key":"552_CR3","unstructured":"Burkard R, Derigs U (1980) Lecture notes in economics and mathematical systems. Lectures Notes in Economics and Mathematical Systems 184"},{"key":"552_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R Burkard","year":"1997","unstructured":"Burkard R, Karisch S, Rendl F (1997) QAPLIB: a quadratic assignment problem library. J Glob Optim 10:391\u2013403","journal-title":"J Glob Optim"},{"key":"552_CR5","volume-title":"The quadratic assignment problem","author":"RE Burkard","year":"1998","unstructured":"Burkard RE, \u00c7ela E, Pardalos PM, Pitsoulis LS (1998) The quadratic assignment problem. Springer, Berlin"},{"issue":"6","key":"552_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse W, Pardalos PM, Prokopyev OA (2004) A new linearization technique for multi-quadratic 0\u20131 programming problems. Oper Res Lett 32(6):517\u2013522","journal-title":"Oper Res Lett"},{"issue":"2","key":"552_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1008696503659","volume":"8","author":"J Clausen","year":"1997","unstructured":"Clausen J, Perregaard M (1997) Solving large quadratic assignment problems in parallel. Comput Optim App 8(2):111\u2013127","journal-title":"Comput Optim App"},{"issue":"5","key":"552_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","volume":"264","author":"B Dezs\u0151","year":"2011","unstructured":"Dezs\u0151 B, J\u00fcttner A, Kov\u00e1cs P (2011) Lemon-an open source c++ graph template library. Electron Notes Theor Comput Sci 264(5):23\u201345","journal-title":"Electron Notes Theor Comput Sci"},{"issue":"3","key":"552_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H Everett III","year":"1963","unstructured":"Everett H III (1963) Generalized lagrange multiplier method for solving problems of optimum allocation of resources. Oper Res 11(3):399\u2013417","journal-title":"Oper Res"},{"issue":"5\u20136","key":"552_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1023\/A:1012252420779","volume":"12","author":"PM Hahn","year":"2001","unstructured":"Hahn PM, Krarup J (2001) A hospital facility layout problem finally solved. J Intell Manuf 12(5\u20136):487\u2013496","journal-title":"J Intell Manuf"},{"issue":"2","key":"552_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/ijoc.1110.0450","volume":"24","author":"PM Hahn","year":"2012","unstructured":"Hahn PM, Zhu YR, Guignard M, Hightower WL, Saltzman MJ (2012) A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem. INFORMS J Comput 24(2):202\u2013209","journal-title":"INFORMS J Comput"},{"issue":"1","key":"552_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/mnsc.13.1.42","volume":"13","author":"FS Hillier","year":"1966","unstructured":"Hillier FS, Connors MM (1966) Quadratic assignment problem algorithms and the location of indivisible facilities. Manag Sci 13(1):42\u201357","journal-title":"Manag Sci"},{"key":"552_CR13","unstructured":"Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econom: J Econom Soc 25(1):53\u201376"},{"key":"552_CR14","doi-asserted-by":"crossref","unstructured":"Krarup J, Pruzan PM (1978) Computer-aided layout design. In: Mathematical programming in use. Springer, Berlin, pp 75\u201394","DOI":"10.1007\/BFb0120827"},{"issue":"4","key":"552_CR15","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler EL (1963) The quadratic assignment problem. Manag Sci 9(4):586\u2013599","journal-title":"Manag Sci"},{"issue":"1","key":"552_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10479-011-1005-1","volume":"191","author":"S Niroomand","year":"2011","unstructured":"Niroomand S, Tak\u00e1cs S, Vizv\u00e1ri B (2011) To lay out or not to lay out? Ann Oper Res 191(1):183\u2013192","journal-title":"Ann Oper Res"},{"issue":"1","key":"552_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"CE Nugent","year":"1968","unstructured":"Nugent CE, Vollmann TE, Ruml J (1968) An experimental comparison of techniques for the assignment of facilities to locations. Oper Res 16(1):150\u2013173","journal-title":"Oper Res"},{"key":"552_CR18","volume-title":"Xpress-mosel: user guide","author":"D Optimization","year":"2004","unstructured":"Optimization D (2004) Xpress-mosel: user guide. Englewood Cliffs, NJ"},{"issue":"3","key":"552_CR19","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23(3):555\u2013565","journal-title":"J ACM"},{"key":"552_CR20","doi-asserted-by":"publisher","unstructured":"Taassori M, Niroomand S, Uysal S, Vizvari B, Hadi-Vencheh A (2017) Optimization approaches for core mapping on networks on chip. IETE J Res 1\u201312. \n                    https:\/\/doi.org\/10.1080\/03772063.2017.1355754","DOI":"10.1080\/03772063.2017.1355754"},{"key":"552_CR21","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.measurement.2015.07.013","volume":"74","author":"M Taassori","year":"2015","unstructured":"Taassori M, Taassori M, Niroomand S, Vizv\u00e1ri B, Uysal S, Hadi-Vencheh A (2015) Opaic: an optimization technique to improve energy consumption and performance in application specific network on chips. Measurement 74:208\u2013220","journal-title":"Measurement"},{"issue":"5","key":"552_CR22","first-page":"393","volume":"7","author":"B Vizv\u00e1ri","year":"1978","unstructured":"Vizv\u00e1ri B (1978) Lagrange multipliers in integer programming. Probl Control Inf Theory 7(5):393\u2013406","journal-title":"Probl Control Inf Theory"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0552-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-018-0552-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0552-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T19:06:44Z","timestamp":1558638404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-018-0552-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,24]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["552"],"URL":"https:\/\/doi.org\/10.1007\/s10100-018-0552-9","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,24]]},"assertion":[{"value":"24 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}