{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T10:14:00Z","timestamp":1785838440850,"version":"3.56.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1023\/a:1008293323270","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T13:47:34Z","timestamp":1040564854000},"page":"391-403","source":"Crossref","is-referenced-by-count":434,"title":["QAPLIB \u2013 A Quadratic Assignment Problem Library"],"prefix":"10.1007","volume":"10","author":[{"given":"Rainer E.","family":"Burkard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan E.","family":"Karisch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"121514_CR1","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"R. Battiti and G. Tecchiolli. The reactive tabu search. ORSA Journal on Computing\n6(2): 126\u2013140, 1994.","journal-title":"ORSA Journal on Computing"},{"key":"121514_CR2","unstructured":"A. Br\u00fcngger, J. Clausen, A. Marzetta and M. Perregaard. Joining forces in solving large-scale quadratic assignment problems. DIKU Technical Report, University of Copenhagen, 1996."},{"key":"121514_CR3","volume-title":"Discrete Location Theory","author":"R.E. Burkard","year":"1991","unstructured":"R.E. Burkard. Locations with spatial interactions: the quadratic assignment problem. In P.B. Mirchandani and R.L. Francis, editors, Discrete Location Theory. Wiley, Berlin, 1991."},{"key":"121514_CR4","series-title":"SFB Report","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"R.E. Burkard","year":"1996","unstructured":"R.E. Burkard and E. \u00c7ela. Quadratic and three-dimensional assignment problems. In M. Dell\u2019Amico, F. Maffioli, and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization. 1996. To appear. Available as SFB Report 63, Graz University of Technology, Graz, Austria."},{"key":"121514_CR5","volume-title":"Assignment and Matching Problems: Solution Methods with Fortran Programs, volume 184 of Lecture Notes in Economics and Mathematical Systems","author":"R.E. Burkard","year":"1980","unstructured":"R.E. Burkard and U. Derigs. Assignment and Matching Problems: Solution Methods with Fortran Programs, volume 184 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, 1980."},{"key":"121514_CR6","first-page":"B121","volume":"21","author":"R.E. Burkard","year":"1977","unstructured":"R.E. Burkard and J. Offermann. Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. Zeitschrift f\u00fcr Operations Research\n21: B121\u2013B132, 1977.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"issue":"2","key":"121514_CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","volume":"17","author":"R.E. Burkard","year":"1984","unstructured":"R.E. Burkard and F. Rendl. A thermodynamically motivated simulation procedure for combinatorial optimization problems. European Journal of Operations Research\n17(2): 169\u2013174, 1984.","journal-title":"European Journal of Operations Research"},{"key":"121514_CR8","volume-title":"The quadratic assignment problem: special cases and relatives","author":"E. \u00c7ela","year":"1995","unstructured":"E. \u00c7ela. The quadratic assignment problem: special cases and relatives. PhD thesis, Graz University of Technology, Graz, Austria, 1995."},{"key":"121514_CR9","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.37.5.760","volume":"37-5","author":"N. Christofides","year":"1989","unstructured":"N. Christofides and E. Benavent. An exact algorithm for the quadratic assignment problem. Operations Research\n37-5: 760\u2013768, 1989.","journal-title":"Operations Research"},{"key":"121514_CR10","unstructured":"J. Clausen and M. Perregaard. Solving large quadratic assignment problems in parallel. Computational Optimization and Applications, 1994. To appear."},{"key":"121514_CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/jors.1977.29","volume":"28","author":"A.N. Elshafei","year":"1977","unstructured":"A.N. Elshafei. Hospital layout as a quadratic assignment problem. Operations Research Quarterly\n28: 167\u2013179, 1977.","journal-title":"Operations Research Quarterly"},{"key":"121514_CR12","unstructured":"B. Eschermann and H.J. Wunderlich. Optimized synthesis of self-testable finite state machines. In 20th International Symposium on Fault-Tolerant Computing (FFTCS 20), Newcastle upon Tyne, 26-28th June, 1990."},{"key":"121514_CR13","doi-asserted-by":"crossref","unstructured":"C. Fleurent and J.A. Ferland. Genetic hybrids for the quadratic assignment problem. In P. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16, pages 173\u2013187. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994.","DOI":"10.1090\/dimacs\/016\/08"},{"key":"121514_CR14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"P.C. Gilmore","year":"1962","unstructured":"P.C. Gilmore. Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM Journal on Applied Mathematics\n10: 305\u201331, 1962.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"121514_CR15","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"S.W. Hadley","year":"1992","unstructured":"S.W. Hadley, F. Rendl, and H. Wolkowicz. A new lower bound via projection for the quadratic assignment problem. Mathematics of Operations Research\n17: 727\u2013739, 1992.","journal-title":"Mathematics of Operations Research"},{"key":"121514_CR16","unstructured":"P. Hahn, T. Grant, and N. Hall. Solution of the quadratic assignment problem using the Hungarian method. European Journal of Operational Research, to appear, 1995."},{"key":"121514_CR17","volume-title":"New linear programming-based solution procedures for the quadratic assignment problem","author":"T.A. Johnson","year":"1992","unstructured":"T.A. Johnson. New linear programming-based solution procedures for the quadratic assignment problem. PhD thesis, Clemson University, Clemson, USA, 1992."},{"key":"121514_CR18","volume-title":"Nonlinear approaches for quadratic assignment and graph partition problems","author":"S.E. Karisch","year":"1995","unstructured":"S.E. Karisch. Nonlinear approaches for quadratic assignment and graph partition problems. PhD thesis, Graz University of Technology, Graz, Austria, 1995."},{"issue":"2","key":"121514_CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01585995","volume":"71","author":"S.E. Karisch","year":"1995","unstructured":"S.E. Karisch and F. Rendl. Lower bounds for the quadratic assignment problem via triangle decompositions. Mathematical Programming\n71(2): 137\u2013152, 1995.","journal-title":"Mathematical Programming"},{"key":"121514_CR20","unstructured":"S.E. Karisch, F. Rendl, H. Wolkowicz, and Q. Zhao. Semidefinite programming relaxations for the quadratic assignment problem. Working paper, CDL-DO, Department of Mathematics, Graz University of Technology, Graz, Austria, 1995."},{"key":"121514_CR21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J. Krarup","year":"1978","unstructured":"J. Krarup and P.M. Pruzan. Computer-aided layout design. Mathematical Programming Study\n9: 75\u201394, 1978.","journal-title":"Mathematical Programming Study"},{"key":"121514_CR22","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E. Lawler","year":"1963","unstructured":"E. Lawler. The quadratic assignment problem. Management Science\n9: 586\u2013599, 1963.","journal-title":"Management Science"},{"key":"121514_CR23","volume-title":"Heuristic and exact algorithms for the quadratic assignment problem","author":"Y. Li","year":"1992","unstructured":"Y. Li. Heuristic and exact algorithms for the quadratic assignment problem. PhD thesis, The Pennsylvania State University, USA, 1992."},{"key":"121514_CR24","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00253805","volume":"1","author":"Y. Li","year":"1992","unstructured":"Y. Li and P.M. Pardalos. Generating quadratic assignment test problems with known optimal permutations. Computational Optimization and Applications\n1: 163\u2013184, 1992.","journal-title":"Computational Optimization and Applications"},{"key":"121514_CR25","doi-asserted-by":"crossref","unstructured":"Y. Li, P.M. Pardalos, and M.G.C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16, pages 237\u2013261. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994.","DOI":"10.1090\/dimacs\/016\/12"},{"key":"121514_CR26","volume-title":"Quadratic assignment problems: solution methods and applications","author":"F. Malucelli","year":"1993","unstructured":"F. Malucelli. Quadratic assignment problems: solution methods and applications. PhD thesis, University of Pisa, Pisa, Italy, 1993."},{"key":"121514_CR27","volume-title":"Contribution\u00e0la r\u00e8solution des prob;\u00e8mes d\u2019implanation: algorithmes s\u00e9quentiels et parall\u00e8les pour l\u2019affectation quadratique","author":"T. Mautor","year":"1992","unstructured":"T. Mautor. Contribution\u00e0la r\u00e8solution des prob;\u00e8mes d\u2019implanation: algorithmes s\u00e9quentiels et parall\u00e8les pour l\u2019affectation quadratique. PhD thesis, Universit\u00e9 Pierre et Marie Curie, Paris, France, 1992."},{"key":"121514_CR28","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C.E. Nugent","year":"1968","unstructured":"C.E. Nugent, T.E. Vollman, and J. Ruml. An experimental comparison of techniques for the assignment of facilities to locations. Operations Research\n16: 150\u2013173, 1968.","journal-title":"Operations Research"},{"key":"121514_CR29","series-title":"Technical Report","volume-title":"Genetic annealing search for index assignment in vector quantization","author":"T. Ostrowski","year":"1996","unstructured":"T. Ostrowski and V.T. Ruoppila. Genetic annealing search for index assignment in vector quantization. Technical Report, Digital Media Institute, Tampere University of Technology, Tampere, Finland, 1996."},{"key":"121514_CR30","doi-asserted-by":"crossref","unstructured":"P.M. Pardalos, F. Rendl, and H. Wolkowicz. The quadratic assignment problem: a survey of recent developments. In P. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16, pages 1\u201342. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994.","DOI":"10.1090\/dimacs\/016\/01"},{"key":"121514_CR31","unstructured":"P.M. Pardalos and H. Wolkowicz, editors. Quadratic Assignment and Related Problems, volume 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 1994."},{"issue":"1","key":"121514_CR32","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/225545.225553","volume":"22","author":"M.G.C. Resende","year":"1996","unstructured":"M.G.C. Resende, P.M. Pardalos, and Y. Li. FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software\n22(1): 104\u2013118, 1996.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"121514_CR33","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1287\/opre.43.5.781","volume":"43","author":"M.G.C. Resende","year":"1995","unstructured":"M.G.C. Resende, K.G. Ramakrishnan, and Z. Drezner. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Operations Research\n43: 781\u2013791, 1995.","journal-title":"Operations Research"},{"key":"121514_CR34","volume-title":"Scheduling, design and assignment problems with quadratic costs","author":"M. Rijal","year":"1995","unstructured":"M. Rijal. Scheduling, design and assignment problems with quadratic costs. PhD thesis, New York University, New York, USA, 1995."},{"key":"121514_CR35","volume-title":"Du sequentiel au parallele: la recherche arborescente et son application\u00e0la programmation quadratique en variables 0 et 1","author":"C. Roucairol","year":"1987","unstructured":"C. Roucairol. Du sequentiel au parallele: la recherche arborescente et son application\u00e0la\nprogrammation quadratique en variables 0 et 1, 1987. Th\u00e8se d\u2019Etat, Universit\u00e9 Pierre et Marie Curie, Paris, France."},{"key":"121514_CR36","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1287\/mnsc.22.2.172","volume":"22","author":"M. Scriabin","year":"1975","unstructured":"M. Scriabin and R.C. Vergin. Comparison of computer algorithms and visual based methods for plant layout. Management Science\n22: 172\u2013187, 1975.","journal-title":"Management Science"},{"issue":"1","key":"121514_CR37","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"J. Skorin-Kapov. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing\n2(1): 33\u201345, 1990.","journal-title":"ORSA Journal on Computing"},{"key":"121514_CR38","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1003003","volume":"3","author":"L. Steinberg","year":"1961","unstructured":"L. Steinberg. The backboard wiring problem: a placement algorithm. SIAM Review\n3: 37\u201350, 1961.","journal-title":"SIAM Review"},{"key":"121514_CR39","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9.D. Taillard","year":"1991","unstructured":"\u00c9.D. Taillard. Robust tabu search for the quadratic assignment problem. Parallel Computing\n17: 443\u2013455, 1991.","journal-title":"Parallel Computing"},{"key":"121514_CR40","doi-asserted-by":"crossref","unstructured":"\u00c9.D. Taillard. Comparison of iterative searches for the quadratic assignment problem. Location Science, 1994. To appear.","DOI":"10.1016\/0966-8349(95)00008-6"},{"key":"121514_CR41","series-title":"Working paper","volume-title":"An improved simulated annealing algorithm for the quadratic assignment problem","author":"U.W. Thonemann","year":"1994","unstructured":"U.W. Thonemann and A. B\u00f6lte. 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, 1994."},{"key":"121514_CR42","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/07408178708975376","volume":"19","author":"M.R. Wilhelm","year":"1987","unstructured":"M.R. Wilhelm and T.L. Ward. Solving quadratic assignment problems by simulated annealing. IIE Transaction\n19\/1: 107\u2013119, 1987.","journal-title":"IIE Transaction"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008293323270.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008293323270\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008293323270.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:39:44Z","timestamp":1751366384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008293323270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["121514"],"URL":"https:\/\/doi.org\/10.1023\/a:1008293323270","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}