{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:31:08Z","timestamp":1726471868108},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T00:00:00Z","timestamp":1542585600000},"content-version":"vor","delay-in-days":1479,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1016\/j.disopt.2014.08.003","type":"journal-article","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T03:45:41Z","timestamp":1410839141000},"page":"97-103","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["A revised reformulation-linearization technique for the quadratic assignment problem"],"prefix":"10.1016","volume":"14","author":[{"given":"Borzou","family":"Rostami","sequence":"first","affiliation":[]},{"given":"Federico","family":"Malucelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2014.08.003_br000005","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","article-title":"The quadratic assignment problem","volume":"9","author":"Lawler","year":"1963","journal-title":"Manage. Sci."},{"key":"10.1016\/j.disopt.2014.08.003_br000010","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"key":"10.1016\/j.disopt.2014.08.003_br000015","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1003003","article-title":"The backboard wiring problem: a placement algorithm","volume":"3","author":"Steinberg","year":"1961","journal-title":"SIAM Rev."},{"key":"10.1016\/j.disopt.2014.08.003_br000020","first-page":"438","article-title":"Optimization of the typewriter keyboard by simulation","volume":"17","author":"Pollatschek","year":"1976","journal-title":"Angew. Inform."},{"key":"10.1016\/j.disopt.2014.08.003_br000025","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.24.4.595","article-title":"Scheduling parallel production lines with changeover costs: Practical application of a quadratic assignment\/LP approach","volume":"24","author":"Geoffrion","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/j.disopt.2014.08.003_br000030","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10479-005-2455-0","article-title":"On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices","volume":"138","author":"Polak","year":"2005","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.disopt.2014.08.003_br000035","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","article-title":"A survey for the quadratic assignment problem","volume":"176","author":"Loiola","year":"2007","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.disopt.2014.08.003_br000040","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0166-218X(83)90018-5","article-title":"On the quadratic assignment problem","volume":"5","author":"Frieze","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disopt.2014.08.003_br000045","doi-asserted-by":"crossref","first-page":"S22","DOI":"10.1287\/opre.40.1.S22","article-title":"A new lower bound for the quadratic assignment problem","volume":"40","author":"Carraresi","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/j.disopt.2014.08.003_br000050","series-title":"Quadratic Assignment and Related Problems","first-page":"147","article-title":"A reformulation scheme and new lower bounds for the QAP","author":"Carraresi","year":"1994"},{"key":"10.1016\/j.disopt.2014.08.003_br000055","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1090\/dimacs\/016\/02","article-title":"Improved linear programming-based lower bounds for the quadratic assignment problem","volume":"16","author":"Adams","year":"1994","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/j.disopt.2014.08.003_br000060","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s006070050040","article-title":"A dual framework for lower bounds of the quadratic assignment problem based on linearization","volume":"63","author":"Karisch","year":"1999","journal-title":"Computing"},{"key":"10.1016\/j.disopt.2014.08.003_br000065","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/opre.46.6.912","article-title":"Lower bounds for the quadratic assignment problem based upon a dual formulation","volume":"46","author":"Hahn","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/j.disopt.2014.08.003_br000070","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/PL00011402","article-title":"A new bound for the quadratic assignment problem based on convex quadratic programming","volume":"89","author":"Anstreicher","year":"2001","journal-title":"Math. Program."},{"key":"10.1016\/j.disopt.2014.08.003_br000075","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","article-title":"A level-2 reformulation-linearization technique bound for the quadratic assignment problem","volume":"180","author":"Adams","year":"2007","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.disopt.2014.08.003_br000080","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/ijoc.1110.0450","article-title":"A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem","volume":"24","author":"Hahn","year":"2012","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.disopt.2014.08.003_br000085","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","article-title":"A tight linearization and an algorithm for zero\u2013one quadratic programming problems","volume":"32","author":"Adams","year":"1986","journal-title":"Manag. Sci."},{"key":"10.1016\/j.disopt.2014.08.003_br000090","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","article-title":"Linearization strategies for a class of zero\u2013one mixed integer programming problems","volume":"38","author":"Adams","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/j.disopt.2014.08.003_br000095","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","article-title":"Comparisons and enhancement strategies for linearizing mixed 0\u20131 quadratic programs","volume":"1","author":"Adams","year":"2004","journal-title":"Discrete Optim."},{"key":"10.1016\/j.disopt.2014.08.003_br000100","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1287\/opre.43.5.781","article-title":"Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming","volume":"43","author":"Resende","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/j.disopt.2014.08.003_br000105","series-title":"Combinatorial and Global Optimization","first-page":"297","article-title":"Tight QAP bounds via linear programming","author":"Ramakrishnan","year":"2002"},{"year":"2007","series-title":"Recent advances and challenges in quadratic assignment and related problems","author":"Zhu","key":"10.1016\/j.disopt.2014.08.003_br000110"},{"key":"10.1016\/j.disopt.2014.08.003_br000115","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","article-title":"QAPLIB\u2014a quadratic assignment problem library","volume":"10","author":"Burkard","year":"1997","journal-title":"J. Global Optim."},{"key":"10.1016\/j.disopt.2014.08.003_br000120","first-page":"1","article-title":"Generating QAP instances with known optimum solution and additively decomposable cost function","author":"Drugan","year":"2013","journal-title":"J. Comb. Optim."}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528614000383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528614000383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T11:41:16Z","timestamp":1542627676000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528614000383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":24,"alternative-id":["S1572528614000383"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2014.08.003","relation":{},"ISSN":["1572-5286"],"issn-type":[{"type":"print","value":"1572-5286"}],"subject":[],"published":{"date-parts":[[2014,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A revised reformulation-linearization technique for the quadratic assignment problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2014.08.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}