{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:51:07Z","timestamp":1769561467770,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983,1]]},"DOI":"10.1016\/0166-218x(83)90018-5","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"89-98","source":"Crossref","is-referenced-by-count":99,"title":["On the quadratic assignment problem"],"prefix":"10.1016","volume":"5","author":[{"given":"A.M.","family":"Frieze","sequence":"first","affiliation":[]},{"given":"J.","family":"Yadegar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0166-218X(83)90018-5_BIB1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/nav.3800260111","article-title":"An exact Branch-and-Bound procedure for the Quadratic Assignment Problem","volume":"26","author":"Bazaraa","year":"1979","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(83)90018-5_BIB2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01584338","article-title":"The Travelling Salesman Problem: a duality approach","volume":"13","author":"Bazaraa","year":"1977","journal-title":"Math. Programming"},{"issue":"1","key":"10.1016\/0166-218X(83)90018-5_BIB3","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(83)90018-5_BIB4","article-title":"Quadratische Zourdnungs Probleme III: Test Beispiele und Rechenzeiten","author":"Burkard","year":"1973","journal-title":"Rechenzentrum Graz Report No. 85"},{"issue":"1","key":"10.1016\/0166-218X(83)90018-5_BIB5","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":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(83)90018-5_BIB6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0120905","article-title":"A Branch and Bound algorithm for the Koopmans\u2013Beckmann Quadratic Assignment Problem","volume":"13","author":"Edwards","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(83)90018-5_BIB7","article-title":"Lagrangean relaxation methods for combinatorial optimisation","author":"Fisher","year":"1978","journal-title":"Proc. Summer School in Combinatorial Optimization, Urbino, Italy"},{"key":"10.1016\/0166-218X(83)90018-5_BIB8","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation and its uses in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(83)90018-5_BIB9","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/opre.14.2.210","article-title":"The optimal assignment of facilities to locations by Branch and Bound","volume":"14","author":"Gavett","year":"1966","journal-title":"Operations Res."},{"key":"10.1016\/0166-218X(83)90018-5_BIB10","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(83)90018-5_BIB11","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimisation","volume":"6","author":"Held","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(83)90018-5_BIB12","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(83)90018-5_BIB13","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(83)90018-5_BIB14","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":"Management Sci."},{"key":"10.1016\/0166-218X(83)90018-5_BIB15","article-title":"Comparison of several heuristic algorithms to solve Quadratic Assignment Problems of the Koopmans\u2013Beckmann type","author":"Los","year":"1978","journal-title":"International Symposium on Location Decisions, Banff, Alberta"},{"key":"10.1016\/0166-218X(83)90018-5_BIB16","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":"Operations Res."},{"key":"10.1016\/0166-218X(83)90018-5_BIB17","article-title":"A Branch and Bound method for Quadratic Assignment Problems: the reduction method","author":"Roucairol","year":"1979","journal-title":"3rd European Congress on Operations Research, Amsterdam"},{"key":"10.1016\/0166-218X(83)90018-5_BIB18","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 Review"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900185?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900185?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T12:29:58Z","timestamp":1554812998000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X83900185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0166218X83900185"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(83)90018-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}