{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:48:36Z","timestamp":1752461316048},"reference-count":36,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0166-218x(94)90014-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"281-293","source":"Crossref","is-referenced-by-count":34,"title":["A new exact algorithm for the solution of quadratic assignment problems"],"prefix":"10.1016","volume":"55","author":[{"given":"Thierry","family":"Mautor","sequence":"first","affiliation":[]},{"given":"Catherine","family":"Roucairol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90014-0_BIB1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/mnsc.9.2.294","article-title":"A heuristic algorithm and simulation approach to the relative allocation of facilities","volume":"9","author":"Armour","year":"1963","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(94)90014-0_BIB2","article-title":"Quadratic 0\u20131 programming by a new linearization","author":"Balas","year":"1980","journal-title":"TIMS\/ORSA Meeting, Washington DC"},{"key":"10.1016\/0166-218X(94)90014-0_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/nav.3800300210","article-title":"A branch and bound based heuristic for solving the quadratic assignment problem","volume":"30","author":"Bazaraa","year":"1983","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(94)90014-0_BIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/nav.3800270104","article-title":"Benders' partitioning scheme applied to a new formulation of the Quadratic Assignment Problem","volume":"27","author":"Bazaraa","year":"1980","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(94)90014-0_BIB5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0377-2217(86)90193-1","article-title":"The asymptotic behaviour of quadratic sum assignment problems: a statistical mechanics approach","volume":"26","author":"Bonomi","year":"1986","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90014-0_BIB6","first-page":"406","article-title":"A parallel genetic heuristic for the quadratic assignment problem","author":"Brown","year":"1989","journal-title":"Proceedings of the 3rd Conference on Genetic Algorithms, Arlington"},{"key":"10.1016\/0166-218X(94)90014-0_BIB7","first-page":"136","article-title":"Allocating facilities with CRAFT","volume":"42","author":"Buffa","year":"1962","journal-title":"Har. Bus. Rev."},{"key":"10.1016\/0166-218X(94)90014-0_BIB8","first-page":"53","article-title":"Some recent advances in quadratic assignment problems","author":"Burkard","year":"1984","journal-title":"Proceedings of the Congress on Math. Programming, Rio de Janeiro"},{"key":"10.1016\/0166-218X(94)90014-0_BIB9","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0377-2217(83)90097-8","article-title":"A heuristic for quadratic boolean programs with applications to quadratic assignment problems","volume":"13","author":"Burkard","year":"1983","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90014-0_BIB10","author":"Burkard","year":"1980"},{"key":"10.1016\/0166-218X(94)90014-0_BIB11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","article-title":"A thermodynamically motivated simulation procedure for combinatorial optimization problems","volume":"17","author":"Burkard","year":"1984","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90014-0_BIB12","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\/0166-218X(94)90014-0_BIB13","article-title":"A new branch and bound algorithm for the quadratic assignment problem","author":"Carraresi","year":"1990","journal-title":"Presented at the 3rd ECCO Meeting, Barcelona"},{"key":"10.1016\/0166-218X(94)90014-0_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0377-2217(80)90108-3","article-title":"Contributions to the quadratic assignment problem","volume":"4","author":"Chrisofides","year":"1980","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90014-0_BIB15","first-page":"351","article-title":"A parallel algorithm for the quadratic assignment problem","author":"Crouse","year":"1989"},{"key":"10.1016\/0166-218X(94)90014-0_BIB16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/jors.1977.29","article-title":"Hospital lay-out as a quadratic assignment problem","volume":"28","author":"Elshafei","year":"1977","journal-title":"Oper. Res. Quart."},{"key":"10.1016\/0166-218X(94)90014-0_BIB17","first-page":"61","article-title":"Quadratic assignment problems","volume":"31","author":"Finke","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(94)90014-0_BIB18","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.24.4.595","article-title":"Scheduling parallel production lines with changeover costs: practical applications of a quadratic assignment\/linear programming approach","volume":"24","author":"Geoffrion","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90014-0_BIB19","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":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(94)90014-0_BIB20","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":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90014-0_BIB21","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"},{"key":"10.1016\/0166-218X(94)90014-0_BIB22","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":"Management Sci."},{"key":"10.1016\/0166-218X(94)90014-0_BIB23","author":"Lawler","year":"1985"},{"key":"10.1016\/0166-218X(94)90014-0_BIB24","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."},{"key":"10.1016\/0166-218X(94)90014-0_BIB25","article-title":"A polynomial-time approximation algorithm for the quadratic assignment problem","author":"Pardalos","year":"1990"},{"key":"10.1016\/0166-218X(94)90014-0_BIB26","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0377-2217(85)90009-8","article-title":"Ranking scalar products to improve bounds for the quadratic assignment problem","volume":"20","author":"Rendl","year":"1985","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90014-0_BIB27","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01585694","article-title":"Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem","volume":"53","author":"Rendl","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)90014-0_BIB28","first-page":"183","article-title":"A reduction method for quadratic assignment problems","volume":"32","author":"Roucairol","year":"1979","journal-title":"Oper. Res. Verfahren"},{"key":"10.1016\/0166-218X(94)90014-0_BIB29","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1051\/ro\/1979130302751","article-title":"Un nouvel algorithme pour le probl\u00e8me d'affectation quadratique","volume":"13","author":"Roucairol","year":"1979","journal-title":"RAIRO"},{"key":"10.1016\/0166-218X(94)90014-0_BIB30","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(87)90022-9","article-title":"A parallel branch and bound algorithm for the quadratic assignment problem","volume":"18","author":"Roucairol","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90014-0_BIB31","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90014-0_BIB32","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":"Management Sci."},{"key":"10.1016\/0166-218X(94)90014-0_BIB33","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0166-218X(94)90014-0_BIB34","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\/0166-218X(94)90014-0_BIB35","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust tabu search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Comput."},{"key":"10.1016\/0166-218X(94)90014-0_BIB36","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/07408178708975376","article-title":"Solving quadratic assignment problems by simulated annealing","volume":"19","author":"Wilhelm","year":"1987","journal-title":"IIE Trans."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:29:52Z","timestamp":1555136992000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0166218X94900140"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90014-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}