{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:17:07Z","timestamp":1760645827246},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212215"},{"type":"electronic","value":"9783642212222"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21222-2_9","type":"book-chapter","created":{"date-parts":[[2011,5,25]],"date-time":"2011-05-25T07:00:34Z","timestamp":1306306834000},"page":"67-74","source":"Crossref","is-referenced-by-count":7,"title":["An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming"],"prefix":"10.1007","author":[{"given":"P. C.","family":"Pop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Matei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s006070050002","volume":"62","author":"G.D. Corso","year":"1999","unstructured":"Corso, G.D., Manzini, G.: Finding exact solutions to the bandwidth minimization problem. Computing\u00a062(3), 189\u2013203 (1999)","journal-title":"Computing"},{"key":"9_CR2","first-page":"157","volume-title":"Proc. 24-th Nat. Conf.","author":"E. Cuthill","year":"1969","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proc. 24-th Nat. Conf., pp. 157\u2013172. ACM, New York (1969)"},{"key":"9_CR3","series-title":"LNCS","first-page":"482","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"B. Koohestani","year":"2010","unstructured":"Koohestani, B., Poli, R.: A Genetic Programming Approach to the Matrix Bandwidth-Minimization Problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06239, pp. 482\u2013491. Springer, Heidelberg (2010)"},{"key":"9_CR4","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. The MIT Press, Cambridge (1992)"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ejor.2005.02.066","volume":"174","author":"A. Lim","year":"2006","unstructured":"Lim, A., Rodriguez, B., Xiao, F.: Heuristics for matrix bandwidth reduction. European Journal of Operational Research\u00a0174(1), 69\u201391 (2006)","journal-title":"European Journal of Operational Research"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10489-006-0019-x","volume":"26","author":"A. Lim","year":"2007","unstructured":"Lim, A., Lin, J., Xiao, F.: Particle swarm optimization and hill climbing for the bandwidth minimization problem. Applied Intelligence\u00a026, 175\u2013182 (2007)","journal-title":"Applied Intelligence"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2007.02.004","volume":"186","author":"R. Marti","year":"2008","unstructured":"Marti, R., Campos, V., Pinana, E.: A branch and bound algorithm for the matrix bandwidth minimization. European Journal of Operational Research\u00a0186, 513\u2013528 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0377-2217(00)00325-8","volume":"135","author":"R. Marti","year":"2001","unstructured":"Marti, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. European Journal of Operational Research\u00a0135(2), 211\u2013220 (2001)","journal-title":"European Journal of Operational Research"},{"key":"9_CR9","unstructured":"Matei, O.: Evolutionary Computation: Principles and Practices. Risoprint (2008)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2008.12.015","volume":"200","author":"N. Mladenovic","year":"2010","unstructured":"Mladenovic, N., Urosevic, D., Perez-Brito, D., Garc\u00eda-Gonz\u00e1lez, C.G.: Variable neighbourhood search for bandwidth reduction. European Journal of Operational Research\u00a0200, 14\u201327 (2010)","journal-title":"European Journal of Operational Research"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C.H. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing\u00a016, 263\u2013270 (1976)","journal-title":"Computing"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","volume":"153","author":"E. Pinana","year":"2004","unstructured":"Pinana, E., Plana, I., Campos, V., Marti, R.: GRASP and path relinking for the matrix bandwidth minimization. European Journal of Operational Research\u00a0153, 200\u2013210 (2004)","journal-title":"European Journal of Operational Research"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.ejor.2005.12.052","volume":"185","author":"E. Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello, E., Jin-Kao, H., Torres-Jimenez, J.: An improved simulated annealing algorithm for bandwidth minimization. European Journal of Operational Research\u00a0185, 1319\u20131335 (2008)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21222-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T09:51:54Z","timestamp":1558605114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21222-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212215","9783642212222"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21222-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}