{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:15:04Z","timestamp":1771035304245,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10732-010-9144-0","type":"journal-article","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T14:54:46Z","timestamp":1283266486000},"page":"527-565","source":"Crossref","is-referenced-by-count":51,"title":["GRASP with path-relinking for the generalized quadratic assignment problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Geraldo R.","family":"Mateus","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"Ricardo M. A.","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,1]]},"reference":[{"key":"9144_CR1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. Aiex","year":"2002","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. J. Heuristics 8, 343\u2013373 (2002)","journal-title":"J. Heuristics"},{"key":"9144_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R.M. Aiex","year":"2003","unstructured":"Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29, 393\u2013430 (2003)","journal-title":"Parallel Comput."},{"key":"9144_CR3","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"R.M. Aiex","year":"2005","unstructured":"Aiex, R.M., Pardalos, P.M., Resende, M.G.C., Toraldo, G.: GRASP with path-relinking for three-index assignment. INFORMS J. Comput. 17, 224\u2013247 (2005)","journal-title":"INFORMS J. Comput."},{"key":"9144_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s11590-006-0021-6","volume":"1","author":"R.M. Aiex","year":"2007","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: A Perl program to create time-to-target plots. Opt. Lett. 1, 201\u2013212 (2007)","journal-title":"Opt. Lett."},{"key":"9144_CR5","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s101070100255","volume":"91","author":"K. Anstreicher","year":"2002","unstructured":"Anstreicher, K., Brixius, N., Goux, J.P., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Math. Program. 91, 563\u2013588 (2002)","journal-title":"Math. Program."},{"key":"9144_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87, 385\u2013399 (2000)","journal-title":"Math. Program."},{"key":"9144_CR7","first-page":"89","volume-title":"Discrete Location Theory","author":"R.E. Burkard","year":"1991","unstructured":"Burkard, R.E.: Locations with spatial interactions: the quadratic assignment problem. In: Discrete Location Theory, pp. 89\u201398. Wiley, New York (1991)"},{"key":"9144_CR8","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1287\/ijoc.1040.0128","volume":"18","author":"J.-F. Cordeau","year":"2006","unstructured":"Cordeau, J.-F., Gaudioso, M., Laporte, G., Moccia, L.: A memetic heuristic for the generalized quadratic assignment problem. INFORMS J. Comput. 18, 433\u2013443 (2006)","journal-title":"INFORMS J. Comput."},{"key":"9144_CR9","unstructured":"Elloumi, S.: Contribution \u00e0 la r\u00e9solution des programmes non lin\u00e9aires en variables 0-1, application aux probl\u00e8mes de placement de t\u00e2ches dans les syst\u00e8mes distribu\u00e9s (th\u00e8se de doctorat in informatique). Technical report, Conservatoire National des Arts et M\u00e9tiers, Paris (1991)"},{"key":"9144_CR10","unstructured":"Elloumi, S., Roupin, F., Soutif, E.: Comparison of different lower bounds for the constrained module allocation problem. Technical Report 473, CNAM-Laboratoire C\u00e9dric, 292 Rue St Martin, 75141 Paris Cedex 03, France (2003)"},{"issue":"1","key":"9144_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/TPWRS.2004.835627","volume":"20","author":"H. Faria Jr.","year":"2005","unstructured":"Faria, H. Jr., Binato, S., Resende, M.G.C., Falc\u00e3o, D.J.: Transmission network design by a greedy randomized adaptive path relinking approach. IEEE Trans. Power Syst. 20(1), 43\u201349 (2005)","journal-title":"IEEE Trans. Power Syst."},{"key":"9144_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9144_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"key":"9144_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and Surveys on Metaheuristics","author":"P. Festa","year":"2002","unstructured":"Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325\u2013367. Kluwer Academic, Norwell (2002)"},{"key":"9144_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P. Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP\u2014Part I: Algorithms. Int. Trans. Oper. Res. 16, 1\u201324 (2009a)","journal-title":"Int. Trans. Oper. Res."},{"key":"9144_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P. Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP\u2014Part II: Applications. Int. Trans. Oper. Res. 16, 131\u2013172 (2009b)","journal-title":"Int. Trans. Oper. Res."},{"key":"9144_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0166-218X(83)90018-5","volume":"5","author":"A. Frieze","year":"1983","unstructured":"Frieze, A., Yadegar, J.: On the quadratic assignment problem. Discrete Appl. Math. 5, 89\u201398 (1983)","journal-title":"Discrete Appl. Math."},{"key":"9144_CR18","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu search and adaptive memory programing\u2014Advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer Academic, Norwell (1996)"},{"key":"9144_CR19","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653\u2013684 (2000)","journal-title":"Control Cybern."},{"key":"9144_CR20","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10589-007-9093-1","volume":"401","author":"P.M. Hahn","year":"2008","unstructured":"Hahn, P.M., Kim, B.-J., Guignard, M., MacGregor Smith, J., Zhu, Y.-R.: An algorithm for the generalized quadratic assignment problem. Comput. Optim. Appl. 401, 351\u2013372 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"9144_CR21","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0377-2217(78)90095-4","volume":"2","author":"L. Kaufman","year":"1978","unstructured":"Kaufman, L., Broeckx, F.: An algorithm for the quadratic assignment problem using benders decomposition. Eur. J. Oper. Res. 2, 204\u2013211 (1978)","journal-title":"Eur. J. Oper. Res."},{"key":"9144_CR22","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 44\u201352 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9144_CR23","unstructured":"Lee, C.-G., Ma, Z.: The generalized quadratic assignment problem. Technical Report MIEOR TR2005-01, Department of Mechanical and Industrial Engineering at the University of Toronto (2005)"},{"key":"9144_CR24","series-title":"DIMACS Series in Discrete Matehematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/dimacs\/016\/12","volume-title":"Quadratic Assignment and Related Problems","author":"Y. Li","year":"1994","unstructured":"Li, Y., Pardalos, P.M., Resende, M.G.C.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series in Discrete Matehematics and Theoretical Computer Science, vol. 16, pp.\u00a0237\u2013261. American Mathematical Society, Providence (1994)"},{"key":"9144_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"9144_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/978-3-540-24838-5_27","volume-title":"Efficient and Experimental Algorithms","author":"C.A.S. Oliveira","year":"2004","unstructured":"Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C.: GRASP with path-relinking for the quadratic assignment problem. In: Ribeiro, C.C., Martins, S.L. (eds.) Efficient and Experimental Algorithms. Lecture Notes in Computer Science, vol. 3059, pp. 356\u2013368. Springer-Verlag, Berlin (2004)"},{"key":"9144_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1379-3","volume-title":"Location, Scheduling, Design and Integer Programming","author":"M. Padberg","year":"1996","unstructured":"Padberg, M., Rijal, M.: Location, Scheduling, Design and Integer Programming. Kluwer Academic, Norwell (1996)"},{"key":"9144_CR28","series-title":"DIMACS Series in Discrete Matehematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/dimacs\/016","volume-title":"The Quadratic Assignment and Related Problems","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos, P.M., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: A survey and recent development. In: Pardalos, P.M., Wolkowicz, H. (eds.) The Quadratic Assignment and Related Problems. DIMACS Series in Discrete Matehematics and Theoretical Computer Science, vol. 16, pp. 1\u201342. American Mathematical Society, Providence (1994)"},{"key":"9144_CR29","unstructured":"Pessoa, A.A., Hahn, P.M., Guignard, M., Zhu, Y.-R.: An improved algorithm for the generalized quadratic assignment problem. Technical Report MIEOR TR2005-01, Electrical and Systems Engineering at the University of Pennsylvania (2008)"},{"key":"9144_CR30","first-page":"219","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2002","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Kluwer Academic, Norwell (2002)"},{"issue":"1","key":"9144_CR31","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.10065","volume":"41","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.C.: A GRASP with path-relinking for private virtual circuit routing. Networks 41(1), 104\u2013114 (2003)","journal-title":"Networks"},{"key":"9144_CR32","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"M.G.C. Resende","year":"2005","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp.\u00a029\u201363. Springer-Verlag, Berlin (2005)"},{"key":"9144_CR33","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2010","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures: Advances and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd edn. Springer Science+Business Media, Berlin (2010)","edition":"2"},{"key":"9144_CR34","first-page":"922","volume-title":"Lecture Notes in Computer Science","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Rosseti, I.: A parallel GRASP for the 2-path network design problem. In: Lecture Notes in Computer Science, vol.\u00a02004, pp. 922\u2013926. Springer-Verlag, Berlin (2002)"},{"key":"9144_CR35","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14, 228\u2013246 (2002)","journal-title":"INFORMS J. Comput."},{"key":"9144_CR36","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10878-004-4838-6","volume":"8","author":"F. Roupin","year":"2004","unstructured":"Roupin, F.: From linear to semidefinite programming: An algorithm to obtain semidefinite relaxations for bivalent quadratic problems. J. Combin. Optim. 8, 469\u2013493 (2004)","journal-title":"J. Combin. Optim."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9144-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9144-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9144-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T19:02:35Z","timestamp":1559502155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9144-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,1]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9144"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9144-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,1]]}}}