{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T13:59:16Z","timestamp":1762351156661},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10479-011-0907-2","type":"journal-article","created":{"date-parts":[[2011,5,31]],"date-time":"2011-05-31T11:14:16Z","timestamp":1306840456000},"page":"285-304","source":"Crossref","is-referenced-by-count":49,"title":["Scatter search for the cutwidth minimization problem"],"prefix":"10.1007","volume":"199","author":[{"given":"Juan J.","family":"Pantrigo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Mart\u00ed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,1]]},"reference":[{"issue":"3","key":"907_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D. Adolphson","year":"1973","unstructured":"Adolphson, D., & Hu, T. C. (1973). Optimal linear ordering. SIAM Journal on Applied Mathematics, 25(3), 403\u2013423.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"907_CR2","volume-title":"Proceedings of international network optimization conference","author":"D. V. Andrade","year":"2007","unstructured":"Andrade, D. V., & Resende, M. G. C. (2007a). GRASP with path-relinking for network migration scheduling. In Proceedings of international network optimization conference."},{"key":"907_CR3","volume-title":"Proceedings of seventh metaheuristics international conference (MIC)","author":"D. V. Andrade","year":"2007","unstructured":"Andrade, D. V., & Resende, M. G. C. (2007b). GRASP with evolutionary path-relinking. In Proceedings of seventh metaheuristics international conference (MIC)."},{"key":"907_CR4","first-page":"116","volume-title":"16th annual international ACM-SIGIR conference on research and development in information retrieval","author":"R. A. Botafogo","year":"1993","unstructured":"Botafogo, R. A. (1993). Cluster analysis for hypertext systems. In 16th annual international ACM-SIGIR conference on research and development in information retrieval (pp. 116\u2013125)."},{"key":"907_CR5","first-page":"37","volume":"2","author":"J. Cohoon","year":"1987","unstructured":"Cohoon, J., & Sahni, S. (1987). Heuristics for the board permutation problem. Journal of VLSI and Computer Systems, 2, 37\u201361.","journal-title":"Journal of VLSI and Computer Systems"},{"key":"907_CR6","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. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"907_CR7","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. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"907_CR8","first-page":"91","volume-title":"Proceedings of the 11th conference on information sciences and systems","author":"F. Gavril","year":"1977","unstructured":"Gavril, F. (1977). Some NP-complete problems on graphs. In Proceedings of the 11th conference on information sciences and systems (pp. 91\u201395)."},{"key":"907_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Norwell: Kluwer Academic."},{"issue":"2","key":"907_CR10","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/S0097539796298340","volume":"29","author":"D. R. Karger","year":"1999","unstructured":"Karger, D. R. (1999). A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM Journal on Computing, 29(2), 492\u2013514.","journal-title":"SIAM Journal on Computing"},{"key":"907_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter search: methodology and implementations in C","author":"M. Laguna","year":"2003","unstructured":"Laguna, M., & Mart\u00ed, R. (2003). Scatter search: methodology and implementations in C. Boston: Kluwer Academic."},{"issue":"3","key":"907_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(89)90016-4","volume":"23","author":"F. Makedon","year":"1989","unstructured":"Makedon, F., & Sudborough, I. H. (1989). On minimizing width in linear layouts. Discrete Applied Mathematics, 23(3), 243\u2013265.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"907_CR13","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0606044","volume":"6","author":"F. Makedon","year":"1985","unstructured":"Makedon, F., Papadimitriou, C., & Sudbourough, I. H. (1985). Topological bandwidth. SIAM Journal on Algebraic and Discrete Methods, 6(3), 418\u2013444.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"907_CR14","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.ejor.2007.02.004","volume":"186","author":"R. Mart\u00ed","year":"2008","unstructured":"Mart\u00ed, R., Campos, V., & Pi\u00f1ana, E. (2008). Branch and bound for the matrix bandwidth minimization. European Journal of Operational Research, 186, 513\u2013528.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"907_CR15","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","volume":"153","author":"E. Pi\u00f1ana","year":"2004","unstructured":"Pi\u00f1ana, E., Plana, I., Campos, V., & Mart\u00ed, R. (2004). GRASP and path relinking for the matrix bandwidth minimization. European Journal of Operational Research, 153(1), 200\u2013210.","journal-title":"European Journal of Operational Research"},{"key":"907_CR16","doi-asserted-by":"crossref","first-page":"3541","DOI":"10.1016\/j.disc.2007.12.058","volume":"309","author":"A. Raspaud","year":"2009","unstructured":"Raspaud, A., Schr\u00f6der, H., S\u00fdkora, O., T\u00f6r\u00f6k, L., & Vrt\u2019o, I. (2009). Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Mathematics, 309, 3541\u20133552.","journal-title":"Discrete Mathematics"},{"key":"907_CR17","unstructured":"Resende, M. G. C., & Andrade, D. V. (2009). Method and system for network migration scheduling. United States Patent Application Publication US2009\/0168665."},{"key":"907_CR18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of metaheuristics","author":"M. G. C. Resende","year":"2003","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2003). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 219\u2013250). Norwell: Kluwer Academic."},{"key":"907_CR19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M. G. C. Resende","year":"2004","unstructured":"Resende, M. G. C., & Werneck, R. F. (2004). A hybrid heuristc for the p-median problem. Journal of Heuristics, 10, 59\u201388.","journal-title":"Journal of Heuristics"},{"key":"907_CR20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"M. G. C. Resende","year":"2010","unstructured":"Resende, M. G. C., Mart\u00ed, R., Gallego, M., & Duarte, A. (2010). GRASP and path relinking for the max-min diversity problem. Computers & Operations Research, 37, 498\u2013508.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"907_CR21","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1051\/ita\/1995290605091","volume":"29","author":"J. Rolim","year":"1995","unstructured":"Rolim, J., S\u00fdkora, O., & Vrt\u2019o, I. (1995). Cutwidth of the de Bruijn graph. RAIRO. Informatique Th\u00e9orique et Applications, 29(6), 509\u2013514.","journal-title":"RAIRO. Informatique Th\u00e9orique et Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0907-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0907-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0907-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:06Z","timestamp":1559138886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0907-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["907"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0907-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,1]]}}}