{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T21:07:55Z","timestamp":1770844075657,"version":"3.50.1"},"reference-count":43,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s13675-014-0033-4","type":"journal-article","created":{"date-parts":[[2014,11,21]],"date-time":"2014-11-21T12:04:36Z","timestamp":1416571476000},"page":"79-110","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["A linear formulation with\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si1.gif\">\n                      <mml:mrow>\n                        <mml:mi>O<\/mml:mi>\n                        <mml:mo stretchy=\"false\">(<\/mml:mo>\n                        <mml:msup>\n                          <mml:mi>n<\/mml:mi>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:msup>\n                        <mml:mo stretchy=\"false\">)<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    variables for quadratic assignment problems with Manhattan distance matrices"],"prefix":"10.1016","volume":"3","author":[{"given":"Serigne","family":"Gueye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Michelon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13675-014-0033-4_CR1","first-page":"983","article-title":"A level-2 reformulation-linearization-technique bound for the quadratic assignment problem","volume":"180","author":"Adams","year":"2007","journal-title":"Disc Opt"},{"key":"10.1007\/s13675-014-0033-4_CR2","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 Disc Math Theor Comput Sci"},{"issue":"2","key":"10.1007\/s13675-014-0033-4_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","article-title":"Linearization strategies for a class of zero-one mixed integer programming problems","volume":"38","author":"Adams","year":"1990","journal-title":"Oper Res"},{"key":"10.1007\/s13675-014-0033-4_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.endm.2008.01.016","article-title":"A new lower bound for the minimum arrangement of a graph","volume":"30","author":"Amaral","year":"2008","journal-title":"Electron Notes Disc Math"},{"key":"10.1007\/s13675-014-0033-4_CR5","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/1016083","article-title":"On the assignment polytope","volume":"16","author":"Balinski","year":"1974","journal-title":"SIAM Rev"},{"key":"10.1007\/s13675-014-0033-4_CR6","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal","volume":"5","author":"Birkhoff","year":"1946","journal-title":"Rev Univ Nac Tucum (A)"},{"issue":"3","key":"10.1007\/s13675-014-0033-4_CR7","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/040609574","article-title":"Solving lift-and-project relaxations of binary integer programs","volume":"16","author":"Burer","year":"2006","journal-title":"SIAM J Opt"},{"key":"10.1007\/s13675-014-0033-4_CR8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","article-title":"Qaplib\u2014 a quadratic assignment problem library","volume":"10","author":"Burkard","year":"1997","journal-title":"J Global Opt"},{"issue":"1","key":"10.1007\/s13675-014-0033-4_CR9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/ijoc.1100.0390","article-title":"Decorous lower bounds for minimum linear arrangement","volume":"23","author":"Caprara","year":"2011","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-014-0033-4_CR10","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1287\/ijoc.1040.0083","article-title":"Laying out sparse graphs with provably minimum bandwidth","volume":"17","author":"Caprara","year":"2005","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-014-0033-4_CR11","unstructured":"Eschermann B, Wunderlich HJ (1990) Optimized synthesis of self-testable finite state machines. In: 20th International symposium on fault-tolerant computing (FFTCS 20), Newcastle upon Tyne (26\u201328th June, 1990)"},{"key":"10.1007\/s13675-014-0033-4_CR12","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1287\/opre.1120.1073","article-title":"Three ideas for the quadratic assignment problem","volume":"60","author":"Fischetti","year":"2012","journal-title":"Oper Res"},{"key":"10.1007\/s13675-014-0033-4_CR13","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97","volume":"5","author":"Floyd","year":"1962","journal-title":"Commun ACM"},{"key":"10.1007\/s13675-014-0033-4_CR14","first-page":"5","article-title":"L\u2019alg\u00e8bre de boole et ses applications en recherche op\u00e9rationnelle","volume":"1","author":"Fortet","year":"1959","journal-title":"Cahier du Centre d\u2019Etudes de Recherche Op\u00e9rationnelle"},{"key":"10.1007\/s13675-014-0033-4_CR15","first-page":"17","article-title":"Application de l\u2019alg\u00e8bre de boole en recherche op\u00e9rationnelle","volume":"4","author":"Fortet","year":"1960","journal-title":"Revue Fran\u00e7aise de Recherche Op\u00e9rationnelle"},{"key":"10.1007\/s13675-014-0033-4_CR16","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":"Disc Appl Math"},{"key":"10.1007\/s13675-014-0033-4_CR17","unstructured":"Garey M, Johnson D (1979) Computers and intractibility: a guide to the theory of NP-completeness. W.H. Freeman & Company, London"},{"issue":"2","key":"10.1007\/s13675-014-0033-4_CR18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","article-title":"Optimal and suboptimal algorithms for the quadratic assignment problem","volume":"10","author":"Gilmore","year":"1962","journal-title":"J Soc Indu Appl Math"},{"issue":"4","key":"10.1007\/s13675-014-0033-4_CR19","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","article-title":"Improved linear integer programming formulations of nonlinear integer problems","volume":"22","author":"Glover","year":"1975","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-014-0033-4_CR20","unstructured":"Gon\u00e7alves AD, Drummond LMA, Pessoa AA, Hahn PM (2013) Improving lower bounds for the quadratic assignment problem by applying a distributed dual ascent algorithm. Corr abs\/1304.0267"},{"key":"10.1007\/s13675-014-0033-4_CR21","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","article-title":"A new lower bound via projection for the quadratic assignment problem","volume":"17","author":"Hadley","year":"1992","journal-title":"Math Oper Res"},{"issue":"2","key":"10.1007\/s13675-014-0033-4_CR22","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.1007\/s13675-014-0033-4_CR23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01585995","article-title":"Lower bounds for the quadratic assignment problem via triangle decompositions","volume":"71","author":"Karisch","year":"1995","journal-title":"Math Program"},{"key":"10.1007\/s13675-014-0033-4_CR24","unstructured":"Karish SE (1995) Nonlinear approaches for quadratic assignment and graph partition problems. Ph.d. thesis, Technical University Graz, austria"},{"key":"10.1007\/s13675-014-0033-4_CR25","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0377-2217(78)90095-4","article-title":"An algorithm for the quadratic assignment problem using benders decomposition","volume":"2","author":"Kaufman","year":"1978","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-014-0033-4_CR26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"issue":"4","key":"10.1007\/s13675-014-0033-4_CR27","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":"Manag Sci"},{"key":"10.1007\/s13675-014-0033-4_CR28","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0166-218X(93)E0168-X","article-title":"Generating lower bounds for the linear arrangement problem","volume":"59","author":"Liu","year":"1995","journal-title":"Disc Appl Math"},{"issue":"6","key":"10.1007\/s13675-014-0033-4_CR29","doi-asserted-by":"crossref","first-page":"3408","DOI":"10.1137\/090748834","article-title":"Estimating bounds for quadratic assignment problems associated with hamming and manhattan distance matrices based on semidefinite programming","volume":"20","author":"Mittelman","year":"2010","journal-title":"SIAM J Opt"},{"key":"10.1007\/s13675-014-0033-4_CR30","unstructured":"Nemhauser GL, Wolsey LA (1979) Integer and combinatorial optimization. Wiley, New Jersey"},{"issue":"1","key":"10.1007\/s13675-014-0033-4_CR31","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","article-title":"An experimental comparison of techniques for the assignment of facilities to locations","volume":"16","author":"Nugent","year":"1968","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13675-014-0033-4_CR32","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ejor.2012.02.010","article-title":"A new exact discrete linear reformulation of the quadratic assignment problem","volume":"220","author":"Nyberg","year":"2012","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-014-0033-4_CR33","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10107-006-0038-8","article-title":"Bounds for the quadratic assignment problem using the bundle method","volume":"109","author":"Rendl","year":"2007","journal-title":"Math Program"},{"issue":"5","key":"10.1007\/s13675-014-0033-4_CR34","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.1007\/s13675-014-0033-4_CR35","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1287\/mnsc.22.2.172","article-title":"Comparison of computer algorithms and visual based methods for plant layout","volume":"22","author":"Scriabin","year":"1975","journal-title":"Manag Sci"},{"issue":"1","key":"10.1007\/s13675-014-0033-4_CR36","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assingnment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA J Comput"},{"key":"10.1007\/s13675-014-0033-4_CR37","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust tabu search for the quadratic assingnment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Comput"},{"key":"10.1007\/s13675-014-0033-4_CR38","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","article-title":"Comparison of iterative searches for the quadratic assingnment problem","volume":"3","author":"Taillard","year":"1995","journal-title":"Location Sci"},{"key":"10.1007\/s13675-014-0033-4_CR39","unstructured":"Thonemann UW, B\u00f6lte A (1994) An improved simulated annealing algorithm for the quadratic assignment problem. Working paper, School of Business, Department of Production and Operations Research, University of Paderborn, Germany"},{"key":"10.1007\/s13675-014-0033-4_CR40","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","article-title":"A theorem on boolean matrix","volume":"9","author":"Warshall","year":"1962","journal-title":"J ACM"},{"issue":"1","key":"10.1007\/s13675-014-0033-4_CR41","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/07408178708975376","article-title":"Solving quadratic assignment problems by simulated annealing","volume":"19","author":"Wilhem","year":"1987","journal-title":"IIE Trans"},{"key":"10.1007\/s13675-014-0033-4_CR42","unstructured":"Zhao Q (1996) Semidefinite programming for assignment and partitioning problems. Ph.d. thesis, University of Waterloo, Ontario, Canada"},{"key":"10.1007\/s13675-014-0033-4_CR43","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","article-title":"Semidefinite relaxations for the quadratic assignment problem","volume":"2","author":"Zhao","year":"1998","journal-title":"J Combin Opt"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-014-0033-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-014-0033-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062100040X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062100040X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-014-0033-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:00Z","timestamp":1761882360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S219244062100040X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["S219244062100040X"],"URL":"https:\/\/doi.org\/10.1007\/s13675-014-0033-4","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2015,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A linear formulation with  variables for quadratic assignment problems with Manhattan distance matrices","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-014-0033-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}