{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:22Z","timestamp":1740099142691,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992525"},{"type":"electronic","value":"9783319992532"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99253-2_7","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T06:14:41Z","timestamp":1534832081000},"page":"82-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Comparative Study of Different Memetic Algorithm Configurations for the Cyclic Bandwidth Sum Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0333-0633","authenticated-orcid":false,"given":"Eduardo","family":"Rodriguez-Tello","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2071-9568","authenticated-orcid":false,"given":"Valentina","family":"Narvaez-Teran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0907-7886","authenticated-orcid":false,"given":"Fr\u00e9deric","family":"Lardeux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300\u2013343 (1984). \nhttps:\/\/doi.org\/10.1016\/0022-0000(84)90071-0","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10878-007-9051-y","volume":"14","author":"Y Chen","year":"2007","unstructured":"Chen, Y., Yan, J.: A study on cyclic bandwidth sum. J. Comb. Optim. 14(2), 295\u2013308 (2007). \nhttps:\/\/doi.org\/10.1007\/s10878-007-9051-y","journal-title":"J. Comb. Optim."},{"key":"7_CR3","first-page":"151","volume-title":"Selected Topics in Graph Theory","author":"FRK Chung","year":"1988","unstructured":"Chung, F.R.K.: Labelings of graphs (Chap. 7). In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, vol. 3, pp. 151\u2013168. Academic Press, Cambridge (1988)"},{"key":"7_CR4","unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th IJCAI, vol. 1, pp. 162\u2013164. Morgan Kaufmann Publishers Inc., San Francisco (1985)"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J Diaz","year":"2002","unstructured":"Diaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002). \nhttps:\/\/doi.org\/10.1145\/568522.568523","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1093\/comnet\/cnw006","volume":"4","author":"R Hamon","year":"2016","unstructured":"Hamon, R., Borgnat, P., Flandrin, P., Robardet, C.: Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum. J. Complex Netw. 4(4), 534\u2013560 (2016). \nhttps:\/\/doi.org\/10.1093\/comnet\/cnw006","journal-title":"J. Complex Netw."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L Harper","year":"1964","unstructured":"Harper, L.: Optimal assignment of numbers to vertices. J. SIAM 12(1), 131\u2013135 (1964). \nhttps:\/\/doi.org\/10.1137\/0112012","journal-title":"J. SIAM"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","volume":"11","author":"P Jaccard","year":"1912","unstructured":"Jaccard, P.: The distribution of the flora in the alpine zone. New Phytol. 11(2), 37\u201350 (1912). \nhttps:\/\/doi.org\/10.1111\/j.1469-8137.1912.tb05611.x","journal-title":"New Phytol."},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11766-001-0016-0","volume":"16","author":"H Jianxiu","year":"2001","unstructured":"Jianxiu, H.: Cyclic bandwidth sum of graphs. Appl. Math. J. Chin. Univ. 16(2), 115\u2013121 (2001). \nhttps:\/\/doi.org\/10.1007\/s11766-001-0016-0","journal-title":"Appl. Math. J. Chin. Univ."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"27637","DOI":"10.1109\/ACCESS.2018.2834550","volume":"6","author":"Y Li","year":"2018","unstructured":"Li, Y., Liang, Y.: Compressed sensing in multi-hop large-scale wireless sensor networks based on routing topology tomography. IEEE Access 6, 27637\u201327650 (2018). \nhttps:\/\/doi.org\/10.1109\/ACCESS.2018.2834550","journal-title":"IEEE Access"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Liberatore, V.: Multicast scheduling for list requests. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 1129\u20131137. IEEE (2002). \nhttps:\/\/doi.org\/10.1109\/INFCOM.2002.1019361","DOI":"10.1109\/INFCOM.2002.1019361"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","volume-title":"Computational Graph Theory","author":"B Monien","year":"1990","unstructured":"Monien, B., Sudborough, I.H.: Embedding one interconnection network in another. In: Tinhofer, G., Mayr, E., Noltemeier, H., Syslo, M.M. (eds.) Computational Graph Theory, vol. 7, pp. 257\u2013282. Springer, Vienna (1990). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-9076-0_13"},{"key":"7_CR13","unstructured":"Oliver, I., Smith, D., Holland, J.: A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the 2nd International Conference on Genetic Algorithms and Their Application, pp. 224\u2013230. L. Erlbaum Associates Inc., Hillsdale (1987)"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Satsangi, D., Srivastava, K., Gursaran, S.: General variable neighbourhood search for cyclic bandwidth sum minimization problem. In: Proceedings of the Students Conference on Engineering and Systems, pp. 1\u20136. IEEE Press, March 2012. \nhttps:\/\/doi.org\/10.1109\/SCES.2012.6199079","DOI":"10.1109\/SCES.2012.6199079"},{"key":"7_CR15","volume-title":"Computational Aspects of VLSI","author":"JD Ullman","year":"1984","unstructured":"Ullman, J.D.: Computational Aspects of VLSI. Computer Science Press, Rockville (1984)"},{"key":"7_CR16","unstructured":"Yuan, J.: Cyclic arrangement of graphs. In: Graph Theory Notes of New York, pp. 6\u201310. New York Academy of Sciences (1995)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99253-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T06:19:04Z","timestamp":1534832344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99253-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992525","9783319992532"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99253-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}