{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:55:27Z","timestamp":1787316927985,"version":"build-2736575974"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0167-6377(97)00047-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:07:44Z","timestamp":1027588064000},"page":"13-17","source":"Crossref","is-referenced-by-count":24,"title":["A solvable case of the quadratic assignment problem"],"prefix":"10.1016","volume":"22","author":[{"given":"Vladimir G","family":"Deineko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard J","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(97)00047-3_BIB1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0001-8708(92)90061-O","article-title":"A canonical decomposition theory for metrics of a finite set","volume":"92","author":"Bandelt","year":"1992","journal-title":"Adv. Math."},{"key":"10.1016\/S0167-6377(97)00047-3_BIB2","doi-asserted-by":"crossref","unstructured":"A. Bruengger, A. Marzetta, J. Clausen, M. Perregaard, Joining forces in solving large-scale quadratic assignment problems, in: Proc. 11th Internat. Parallel Processing Symp. IPPS 97, Geneva, IEEE Computer Soc. Press, Silver Spring, MD, 1997, pp. 418\u2013427.","DOI":"10.1109\/IPPS.1997.580936"},{"key":"10.1016\/S0167-6377(97)00047-3_BIB3","unstructured":"R.E. Burkard, Locations with spatial interactions: the quadratic assignment problem, in: P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Ch. 9, Wiley, New York, 1990, pp. 387\u2013437."},{"key":"10.1016\/S0167-6377(97)00047-3_BIB4","unstructured":"R.E. Burkard, E.\u00c7ela, G. Rote, G.J. Woeginger, The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases, in: Proc. IPCO V, Lecture Notes in Computer Science, vol. 1084, Springer, Berlin, 1996, pp. 204\u2013218."},{"key":"10.1016\/S0167-6377(97)00047-3_BIB5","unstructured":"G. Christopher, M. Farach, M. Trick, in: Proc. ESA IV, Lecture Notes in Computer Science, vol. 1136, Springer, Berlin, 1996, pp. 406\u2013418."},{"key":"10.1016\/S0167-6377(97)00047-3_BIB6","unstructured":"P.J. Davis, Circulant Matrices, Wiley, New York, 1979."},{"key":"10.1016\/S0167-6377(97)00047-3_BIB7","doi-asserted-by":"crossref","unstructured":"V.G. Deineko, R. Rudolf, G.J. Woeginger, Sometimes travelling is easy: the master tour problem, in: Proc. ESA III, Lecture Notes in Computer Science, vol. 979, Springer, Berlin, 1995, pp. 128\u2013141.","DOI":"10.1007\/3-540-60313-1_139"},{"key":"10.1016\/S0167-6377(97)00047-3_BIB8","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.4153\/CJM-1975-104-6","article-title":"Edgeconvex circuits and the travelling salesman problem","volume":"27","author":"Kalmanson","year":"1975","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0167-6377(97)00047-3_BIB9","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\/S0167-6377(97)00047-3_BIB10","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\/S0167-6377(97)00047-3_BIB11","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, The quadratic assignment problem: a brief review, in: B. Roy (Ed.), Combinatorial Programming: Methods and Applications, Kluwer, Dordrecht, Holland, 1975, pp. 351\u2013360.","DOI":"10.1007\/978-94-011-7557-9_20"},{"key":"10.1016\/S0167-6377(97)00047-3_BIB12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00253805","article-title":"Generating quadratic assignment problems with known optimal permutations","volume":"1","author":"Li","year":"1992","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/S0167-6377(97)00047-3_BIB13","doi-asserted-by":"crossref","unstructured":"P.M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: a survey and recent developments, in: P. Pardalos, H. Wolkowicz (Eds.), Proc. DIMACS Workshop on Quadratic Assignment Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, 1994, pp. 1\u201342.","DOI":"10.1090\/dimacs\/016\/01"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000473?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000473?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T09:55:54Z","timestamp":1578477354000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637797000473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0167637797000473"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00047-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}