{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T13:03:30Z","timestamp":1774357410743,"version":"3.50.1"},"reference-count":87,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Syst., Man, Cybern. A"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/tsmca.2009.2014556","type":"journal-article","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T02:23:22Z","timestamp":1240021402000},"page":"579-596","source":"Crossref","is-referenced-by-count":101,"title":["Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem"],"prefix":"10.1109","volume":"39","author":[{"given":"Tabitha","family":"James","sequence":"first","affiliation":[]},{"given":"C\u00c9sar","family":"Rego","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","first-page":"309","author":"rego","year":"2002","journal-title":"The Traveling Salesman Problem and Its Variations"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.12.035"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23667-8_20"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00288-9"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1991.3.2.268"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.33"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1002\/net.20360"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2005.74"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)90017-5"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125454"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.066"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4567-5_1"},{"key":"ref32","first-page":"297","author":"glover","year":"1999","journal-title":"New Ideas in Optimization"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ENC.2003.1232903"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0110022"},{"key":"ref37","first-page":"773","article-title":"exponential and chaotic neurodynamical tabu searches for quadratic assignment problems","volume":"29","author":"hasegawa","year":"2000","journal-title":"Control Cybern"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012252420779"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/43.644032"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ref60","author":"nystrom","year":"1999","journal-title":"Solving certain large instances of the quadratic assignment problem Steinberg's examples"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039522.58036.68"},{"key":"ref61","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/978-3-540-24838-5_27","volume":"3059","author":"oliveira","year":"2004","journal-title":"Efficient and Experimental Algorithms"},{"key":"ref63","first-page":"7","article-title":"a multistart tabu search approach for graph coloring","volume":"21","author":"palubeckis","year":"2001","journal-title":"Inf Technol Control"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600676"},{"key":"ref64","first-page":"29","article-title":"application of multistart tabu search to the max-cut problem","volume":"2","author":"palubeckis","year":"2004","journal-title":"Informaacines Technologijos Ir Valdymas"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.2.198"},{"key":"ref65","first-page":"111","author":"pardalos","year":"1995","journal-title":"Parallel Algorithms for Irregular Structured ProblemsIrregular'94"},{"key":"ref66","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/dimacs\/016\/01","volume":"16","author":"pardalos","year":"1994","journal-title":"Quadratic Assignment and Related Problems"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.06.014"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/3468.995530"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-2455-0"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(86)90007-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1060.0201"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.08.066"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/3468.686706"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref21","first-page":"165","article-title":"scatter search for the quadratic assignment problem","author":"cung","year":"1996","journal-title":"Proc IEEE Int Conf Evol Comput"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00438-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.320.16076"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1090\/dimacs\/016\/08","volume":"16","author":"fleurent","year":"1994","journal-title":"Quadratic Assignment and Related Problems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00027-7"},{"key":"ref50","first-page":"321","volume":"57","author":"lourenco","year":"2003","journal-title":"Handbook of Metaheuristics"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/69.806935"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/72.265961"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF01719267"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-4562-x"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2004.03.001"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-7051(03)00027-3"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90014-0"},{"key":"ref53","first-page":"339","article-title":"a dynamic-programming bound for the quadratic assignment problem","volume":"1627","author":"marzetta","year":"1999","journal-title":"Proc COCOON"},{"key":"ref52","first-page":"299","article-title":"large-step markov chains for the traveling salesman problem","volume":"5","author":"martin","year":"1991","journal-title":"Complex Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018973327327"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"key":"ref40","first-page":"215","author":"johnson","year":"1997","journal-title":"Local Search in Combinatorial Optimization"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01421958"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90231-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.1.S22"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","author":"cela","year":"1998","journal-title":"The Quadratic Assignment Problem Theory and Algorithms"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)E0020-T"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008696503659"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80147-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.2.125"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1080\/07408178708975376"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270337"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-3069-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90301-Q"},{"key":"ref80","first-page":"33","author":"sttzle","year":"1999","journal-title":"New Ideas for Optimization"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","article-title":"recent advances in the solution of quadratic assignment problems","volume":"97","author":"anstreicher","year":"2003","journal-title":"Math Program"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00067-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100255"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/10556780108805828","article-title":"solving quadratic assignment problems using convex quadratic programming relaxations","volume":"16","author":"anstreicher","year":"2001","journal-title":"Optim Methods Softw"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00293-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.126"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022565"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(85)90025-2"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/21.257766"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.840835"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0199-8"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00104-X"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2006.08.002"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/dimacs\/016\/12","volume":"16","author":"li","year":"1994","journal-title":"Quadratic Assignment and Related Problems"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.586"},{"key":"ref42","first-page":"84","article-title":"iterated k-opt local search for the maximum clique problem","volume":"4446","author":"katayama","year":"2007","journal-title":"Proc EvoCOP"},{"key":"ref41","first-page":"459","article-title":"tabu search and genetic algorithms for the generalized graph partitioning problem","volume":"24","author":"kaduczka","year":"1995","journal-title":"Control Cybern"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.2307\/1907742"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)90018-3"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/3468\/4815381\/04803773.pdf?arnumber=4803773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:45:23Z","timestamp":1633913123000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4803773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":87,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tsmca.2009.2014556","relation":{},"ISSN":["1083-4427"],"issn-type":[{"value":"1083-4427","type":"print"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}