{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:46:31Z","timestamp":1725871591438},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319503066"},{"type":"electronic","value":"9783319503073"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50307-3_4","type":"book-chapter","created":{"date-parts":[[2016,11,24]],"date-time":"2016-11-24T15:11:18Z","timestamp":1480000278000},"page":"57-64","source":"Crossref","is-referenced-by-count":1,"title":["Data Exchange Topologies for the DISCO-HITS Algorithm to Solve the QAP"],"prefix":"10.1007","author":[{"given":"Omar","family":"Abdelkafi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhassane","family":"Idoumghar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Lepagnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Br\u00e9villiers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,25]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T Koopmans","year":"1957","unstructured":"Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. University of Lille - CNRS - INRIA, John wiley and sons Inc. (2009)","DOI":"10.1002\/9780470496916"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignement problem. Parallel Comput. 17, 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"James, T., Rego, C., Glover, F.: Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 39 (3), 579\u2013596 (2009)","DOI":"10.1109\/TSMCA.2009.2014556"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"4800","DOI":"10.1016\/j.amc.2012.10.106","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.K.: Breakout local search for the quadratic assignement problem. Appl. Math. Comput. 219, 4800\u20134815 (2013)","journal-title":"Appl. Math. Comput."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.ejor.2007.06.061","volume":"195","author":"T James","year":"2009","unstructured":"James, T., Rego, C., Glover, F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195, 810\u2013826 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1016\/j.jpdc.2012.07.014","volume":"73","author":"M Czapinski","year":"2013","unstructured":"Czapinski, M.: An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform. J. Parallel Distrib. Comput. 73, 1461\u20131468 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0167-739X(99)00124-7","volume":"17","author":"EG Talbi","year":"2001","unstructured":"Talbi, E.G., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Gener. Comput. Syst. 17, 441\u2013449 (2001)","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"4_CR9","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/MIS.2005.74","volume":"20","author":"T James","year":"2005","unstructured":"James, T., Rego, C., Glover, F.: Sequential and parallel path relinking algorithms for the quadratic assignment problem. IEEE Intell. Syst. 20(4), 58\u201365 (2005)","journal-title":"IEEE Intell. Syst."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.engappai.2014.12.011","volume":"39","author":"U Tosun","year":"2015","unstructured":"Tosun, U.: On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem. Eng. Appl. Artif. Intell. 39, 267\u2013278 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"2703","DOI":"10.1016\/j.procs.2015.05.392","volume":"51","author":"O Abdelkafi","year":"2015","unstructured":"Abdelkafi, O., Idoumghar, L., Lepagnot, J.: Comparison of two diversification methods to solve the quadratic assignment problem. Procedia Comput. Sci. 51, 2703\u20132707 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.cie.2015.03.001","volume":"85","author":"T Dokeroglu","year":"2015","unstructured":"Dokeroglu, T.: Hybrid teaching-learning-based optimization algorithms for the quadratic assignment problem. Comput. Ind. Eng. 85, 86\u2013101 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997)","DOI":"10.1023\/A:1008293323270"}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence Based Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50307-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T13:49:24Z","timestamp":1601214564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50307-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503066","9783319503073"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50307-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}