{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T18:02:38Z","timestamp":1769018558910,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/0305-0548(86)90052-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"587-600","source":"Crossref","is-referenced-by-count":10,"title":["A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem"],"prefix":"10.1016","volume":"13","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Rajgopal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(86)90052-3_BIB1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmanns","year":"1957","journal-title":"Economeirica"},{"key":"10.1016\/0305-0548(86)90052-3_BIB2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/jors.1977.29","article-title":"Hospital layout as a quadratic assignment problem","volume":"28","author":"Elshafei","year":"1977","journal-title":"Opns Res. Q."},{"key":"10.1016\/0305-0548(86)90052-3_BIB3","series-title":"The utility of optimization techniques in the design of man-machine systems","author":"Dorris","year":"1971"},{"key":"10.1016\/0305-0548(86)90052-3_BIB4","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/320893.320896","article-title":"Formal procedures for connected terminals with a minimum total wire length","volume":"4","author":"Loberman","year":"1957","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(86)90052-3_BIB5","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\/0305-0548(86)90052-3_BIB6","first-page":"3","article-title":"An urban systems study","volume":"10","author":"Sharpe","year":"1972","journal-title":"R. Aust. Plann. Inst. J."},{"key":"10.1016\/0305-0548(86)90052-3_BIB7","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":"Opns Res."},{"key":"10.1016\/0305-0548(86)90052-3_BIB8","series-title":"A quadratic assignment linear programming approach to ship scheduling for the U.S. Coast Guard","author":"Sibre","year":"1977"},{"key":"10.1016\/0305-0548(86)90052-3_BIB9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","article-title":"Scheduling to minimize interactive costs","volume":"14","author":"Carlson","year":"1966","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(86)90052-3_BIB10","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","article-title":"The quadratic assignment problem","volume":"19","author":"Lawler","year":"1963","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(86)90052-3_BIB11","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1984"},{"key":"10.1016\/0305-0548(86)90052-3_BIB12","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":"Opns Res."},{"key":"10.1016\/0305-0548(86)90052-3_BIB13","article-title":"Simultaneous optimization of land use and transportation: a synthesis of the quadratic assignment problem and of the optimal network problem","author":"Los","year":"1977","journal-title":"Reg. Sci. Urban Econ."},{"key":"10.1016\/0305-0548(86)90052-3_BIB14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/nav.3800250111","article-title":"Numerical investigation on the quadratic assignment problem","volume":"25","author":"Burkard","year":"1978","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(86)90052-3_BIB15","article-title":"Locational decisions with interactions between facilities: the quadratic assignment problem\u2014a review","author":"Mirchandani","year":"1979"},{"key":"10.1016\/0305-0548(86)90052-3_BIB16","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":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(86)90052-3_BIB17","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/mnsc.27.4.442","article-title":"The quadratic assignment problem: an experimental evaluation of solution strategies","volume":"27","author":"Liggett","year":"1981","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(86)90052-3_BIB18","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1287\/mnsc.30.10.1238","article-title":"A perturbation scheme to improve Hillier's solution to the facilities layout problem","volume":"30","author":"Picone","year":"1984","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(86)90052-3_BIB19","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":"Afar. Res. Logist. Q."},{"key":"10.1016\/0305-0548(86)90052-3_BIB20","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1057\/jors.1982.210","article-title":"On the use of exact and heuristic cutting plane methods for the quadratic assignment problem","volume":"33","author":"Bazaraa","year":"1982","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/0305-0548(86)90052-3_BIB21","article-title":"A computationally simplified pair exchange algorithm for the quadratic assignment problem","author":"Heider","year":"1972","journal-title":"Professional Paper Number 101"},{"key":"10.1016\/0305-0548(86)90052-3_BIB22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/nav.3800150105","article-title":"Suboptimal algorithms for the quadratic assignment problem","volume":"15","author":"Gaschutz","year":"1968","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(86)90052-3_BIB23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","article-title":"An r-dimensional quadratic placement algorithm","volume":"17","author":"Hall","year":"1970","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(86)90052-3_BIB24","series-title":"The quadratic assignment problem: exact and heuristic methods","author":"Sherali","year":"1979"},{"key":"10.1016\/0305-0548(86)90052-3_BIB25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(76)90006-X","article-title":"Prepartitioning as a means of enhancing pair wise interchange solutions to quadratic assignment problems","volume":"3","author":"Patel","year":"1976","journal-title":"Comput. Opns Res."},{"key":"10.1016\/0305-0548(86)90052-3_BIB26","series-title":"The quadratic assignment problem: evaluation of exact and heuristic algorithms","author":"Obata","year":"1979"},{"key":"10.1016\/0305-0548(86)90052-3_BIB27","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0377-2217(82)90013-3","article-title":"A heuristic procedure for solving the quadratic assignment problem","volume":"9","author":"Murtagh","year":"1982","journal-title":"Eur. J. Opns Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054886900523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054886900523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:54:21Z","timestamp":1552928061000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054886900523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0305054886900523"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(86)90052-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}