{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:25:15Z","timestamp":1759667115587},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T00:00:00Z","timestamp":1386806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10878-013-9689-6","type":"journal-article","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T00:56:48Z","timestamp":1386723408000},"page":"1138-1172","source":"Crossref","is-referenced-by-count":6,"title":["Generating QAP instances with known optimum solution and additively decomposable cost function"],"prefix":"10.1007","volume":"30","author":[{"given":"M\u0103d\u0103lina M.","family":"Drugan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,12]]},"reference":[{"issue":"4","key":"9689_CR1","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1015454612213","volume":"8","author":"E Angel","year":"2002","unstructured":"Angel E, Zissimopoulos V (2002) On the hardness of the quadratic assignment problem with metaheuristics. J Heuristics 8(4):399\u2013414","journal-title":"J Heuristics"},{"key":"9689_CR2","unstructured":"Burkard RE, \u00c7ela E, Demidenko VM, Metelski NN, Woeginger GJ (1997) Perspectives of easy and hard cases of the quadratic assignment problems. Technical report, Institute of Mathematics Technical University Graz, Austria"},{"key":"9689_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard RE, Karisch SE, Rendl F (1997) QAPLIB a quadratic assignment problem library. J Glob Optim 10:391\u2013403","journal-title":"J Glob Optim"},{"key":"9689_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The quadratic assignment problem: theory and algorithms","author":"E \u00c7ela","year":"1998","unstructured":"\u00c7ela E (1998) The quadratic assignment problem: theory and algorithms. Kluwer Academic Publishers, Dordrecht"},{"issue":"1","key":"9689_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner Z, Hahn PM, Taillard \u00c9D (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann Oper Res 139(1):65\u201394","journal-title":"Ann Oper Res"},{"key":"9689_CR6","doi-asserted-by":"crossref","unstructured":"Drugan MM (2013) Instance generator for the quadratic assignment problem with additively decomposable cost function. In: IEEE Congress on Evolutionary Computation (CEC\u201913), IEEE, pp 2086\u20132093","DOI":"10.1109\/CEC.2013.6557815"},{"key":"9689_CR7","doi-asserted-by":"crossref","unstructured":"Erdogan G, Tansel B (2011) Two classes of quadratic assignment problems that are solvable as linear assignment problems. Discret Optim 8(3):446\u2013451","DOI":"10.1016\/j.disopt.2011.03.002"},{"issue":"1","key":"9689_CR8","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1137\/S0895480199355225","volume":"15","author":"J Garnier","year":"2001","unstructured":"Garnier J, Kallel L (2001) Efficiency of local search with multiple local optima. SIAM J Discret Math 15(1):122\u2013141","journal-title":"SIAM J Discret Math"},{"key":"9689_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"PC Gilmore","year":"1962","unstructured":"Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J Appl Math 10:305\u2013331","journal-title":"SIAM J Appl Math"},{"key":"9689_CR10","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"SW Hadley","year":"1992","unstructured":"Hadley SW, Rendl F, Wolkowicz H (1992) A new lower bound via projection for the quadratic assignment problem. Math Oper Res 17:727\u2013739","journal-title":"Math Oper Res"},{"issue":"1","key":"9689_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.11.062","volume":"194","author":"P Krokhmal","year":"2009","unstructured":"Krokhmal P, Pardalos P (2009) Random assignment problems. Eur J Oper Res 194(1):1\u201317","journal-title":"Eur J Oper Res"},{"key":"9689_CR12","doi-asserted-by":"crossref","unstructured":"Li Y, Pardalos PM, Resende MGC (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos P, Wolkowicz H (eds) Quadratic assignment and related problems, volume 16 of DIMACS Series, in Discrete Mathematics and Theoretical Computer Science, pp 237\u2013261","DOI":"10.1090\/dimacs\/016\/12"},{"issue":"2","key":"9689_CR13","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) An analytical survey for the quadratic assignment problem. Eur J Oper Res 176(2):657\u2013690","journal-title":"Eur J Oper Res"},{"key":"9689_CR14","doi-asserted-by":"crossref","unstructured":"Marzetta A, Br\u00fcngger A (1999) A dynamic-programming bound for the quadratic assignment problem. In COCOON\u201999, volume LNCS 1627, Springer, Berlin, pp 339\u2013348","DOI":"10.1007\/3-540-48686-0_34"},{"issue":"4","key":"9689_CR15","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"9689_CR16","first-page":"281","volume":"11","author":"G Palubeckis","year":"2000","unstructured":"Palubeckis G (2000) An algorithm for construction of test cases for the quadratic assignment problem. Informatica Lith Acad Sci 11(3):281\u2013296","journal-title":"Informatica Lith Acad Sci"},{"key":"9689_CR17","doi-asserted-by":"crossref","unstructured":"Puglierin F, Drugan MM, Wiering M (2013) Bandit-inspired memetic algorithms for solving quadratic assignment problems. In IEEE Congress on, Evolutionary Computation (CEC\u201913), pp 2078\u20132085","DOI":"10.1109\/CEC.2013.6557814"},{"key":"9689_CR18","doi-asserted-by":"crossref","unstructured":"Siarry P, Michalewicz Z (eds) (2008) Advances in metaheuristics for hard optimization. Springer, Berlin","DOI":"10.1007\/978-3-540-72960-0"},{"key":"9689_CR19","doi-asserted-by":"crossref","unstructured":"St\u00fctzle T, Fernandes S (2004) New benchmark instances for the qap and the experimental analysis of algorithms. In EvoCOP, pp 199\u2013209","DOI":"10.1007\/978-3-540-24652-7_20"},{"key":"9689_CR20","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9D Taillard","year":"1991","unstructured":"Taillard \u00c9D (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17:443\u2013455","journal-title":"Parallel Comput"},{"key":"9689_CR21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"\u00c9D Taillard","year":"1995","unstructured":"Taillard \u00c9D (1995) Comparison of iterative searches for the quadratic assignment problem. Locat Sci 3:87\u2013105","journal-title":"Locat Sci"},{"issue":"2","key":"9689_CR22","first-page":"164","volume":"12","author":"A Wayne","year":"1946","unstructured":"Wayne A (1946) Inequalities and inversions of order. Scripta Mathematica 12(2):164\u2013169","journal-title":"Scripta Mathematica"},{"issue":"11","key":"9689_CR23","doi-asserted-by":"crossref","first-page":"2858","DOI":"10.1016\/j.cor.2012.02.017","volume":"39","author":"SE Wright","year":"2012","unstructured":"Wright SE (2012) New linearizations of quadratic assignment problems. Comput Oper Res 39(11):2858\u20132866","journal-title":"Comput Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9689-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9689-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9689-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T15:41:47Z","timestamp":1564933307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9689-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9689"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9689-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,12]]}}}