{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:54:09Z","timestamp":1760648049242,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031646041"},{"type":"electronic","value":"9783031646058"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-64605-8_1","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T05:01:59Z","timestamp":1719810119000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Multi-centrality Heuristic for\u00a0the\u00a0Bandwidth Reduction Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8592-6827","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Maues","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6819-4305","authenticated-orcid":false,"given":"Israel","family":"Mendon\u00e7a","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6110-7424","authenticated-orcid":false,"given":"Glauco","family":"Amorim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4863-542X","authenticated-orcid":false,"given":"Sanderson L.","family":"Gonzaga de Oliveira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3803-2043","authenticated-orcid":false,"given":"Ana Isabel","family":"Pereira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3874-784X","authenticated-orcid":false,"given":"Diego","family":"Brand\u00e3o","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0057-7670","authenticated-orcid":false,"given":"Pedro Henrique","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Marti, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135(2), 450\u2013459 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00325-8. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221700003258. Financial Modelling","DOI":"10.1016\/S0377-2217(00)00325-8"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Chagas, G.O., Gonzaga de Oliveira, S.L.: Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review. Procedia Comput. Sci. 51, 211\u2013220 (2015). https:\/\/doi.org\/10.1016\/j.procs.2015.05.229. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050915010376. International Conference on Computational Science, ICCS 2015","DOI":"10.1016\/j.procs.2015.05.229"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Chinn, P.Z., Chv\u00e1talov\u00e1, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices\u2014a survey. J. Graph Theory 6(3), 223\u2013254 (1982). https:\/\/doi.org\/10.1002\/jgt.3190060302. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/jgt.3190060302","DOI":"10.1002\/jgt.3190060302"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 1969 24th National Conference (1969). https:\/\/doi.org\/10.1145\/800195.805928","DOI":"10.1145\/800195.805928"},{"issue":"1","key":"1_CR5","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"1_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), 1st edn. W. H. Freeman (1979). http:\/\/www.amazon.com\/Computers-Intractability-NP-Completeness-Mathematical-Sciences\/dp\/0716710455"},{"key":"1_CR7","unstructured":"George, J.A.: Computer implementation of the finite element method. Ph.D. thesis, Computer Science Department, Stanford University, CA, USA (1971)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L.: An evaluation of heuristic methods for the bandwidth reduction of large-scale graphs. Revista Pesquisa Operacional 43(e268255), 1\u201322 (2023)","DOI":"10.1590\/0101-7438.2023.043.00268255"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Bernardes, J.A.B., Chagas, G.O.: An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method. Comput. Appl. Math. 37, 2965\u20133004 (2018)","DOI":"10.1007\/s40314-017-0490-5"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Carvalho, C.: Metaheuristic algorithms for the bandwidth reduction of large-scale matrices. J. Comb. Optim. 43, 727\u2013784 (2022)","DOI":"10.1007\/s10878-021-00801-6"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Silva, L.M.: Evolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG method. Eng. Comput. 36, 1857\u20131873 (2020)","DOI":"10.1007\/s00366-019-00801-5"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Silva, L.M.: Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy. Rairo - Oper. Res. 55(4), 2247\u20132264 (2021)","DOI":"10.1051\/ro\/2021102"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Gonzaga de Oliveira, S.L., Bernardes, J.A.B., Chagas, G.O.: An evaluation of low-cost heuristics for matrix bandwidth and profile reductions. Comput. Appl. Math. 37(2), 1412\u20131471 (2018). https:\/\/doi.org\/10.1007\/s40314-016-0394-9","DOI":"10.1007\/s40314-016-0394-9"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Gonzaga de Oliveira, S., Silva, L.: An ant colony hyperheuristic approach for matrix bandwidth reduction. Appl. Soft Comput. 94, 106434 (2020). https:\/\/doi.org\/10.1016\/j.asoc.2020.106434. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494620303744","DOI":"10.1016\/j.asoc.2020.106434"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Hettmansperger, T.P., McKean, J.W.: Robust Nonparametric Statistical Methods. CRC Press (2010)","DOI":"10.1201\/b10451"},{"key":"1_CR16","unstructured":"Kaveh, A.: Structural Mechanics: Graph and Matrix Methods. Research Studies Press (2004)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-1-4471-2318-7_7","volume-title":"Research and Development in Intelligent Systems XXVIII","author":"B Koohestani","year":"2011","unstructured":"Koohestani, B., Poli, R.: A hyper-heuristic approach to evolving algorithms for bandwidth reduction based on genetic programming. In: Bramer, M., Petridis, M., Nolle, L. (eds.) Research and Development in Intelligent Systems XXVIII, pp. 93\u2013106. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-1-4471-2318-7_7"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1142\/S0218213007003394","volume":"16","author":"A Lim","year":"2007","unstructured":"Lim, A., Rodrigues, B., Xiao, F.: Int. J. Artif. Intell. Tools 16, 537\u2013544 (2007)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Mladenovic, N., Urosevic, D., P\u00e9rez-Brito, D., Garc\u00eda-Gonz\u00e1lez, C.: Variable neighbourhood search for bandwidth reduction. Eur. J. Oper. Res. 200, 14\u201327 (2010). https:\/\/doi.org\/10.1016\/j.ejor.2008.12.015","DOI":"10.1016\/j.ejor.2008.12.015"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Pratt, J.W.: Remarks on zeros and ties in the Wilcoxon signed rank procedures. J. Am. Stat. Assoc. 54, 655\u2013667 (1959). https:\/\/api.semanticscholar.org\/CorpusID:120225998","DOI":"10.1080\/01621459.1959.10501526"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ins.2014.12.041","volume":"303","author":"J Torres-Jimenez","year":"2015","unstructured":"Torres-Jimenez, J., Izquierdo-Marquez, I., Garcia-Robledo, A., Gonzalez-Gomez, A., Bernal, J., Kacker, R.N.: A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs. Inf. Sci. 303, 33\u201349 (2015)","journal-title":"Inf. Sci."},{"key":"1_CR22","unstructured":"West, D.B.: Introduction to Graph Theory, 2 edn. Prentice Hall (2000)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64605-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T05:02:24Z","timestamp":1719810144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64605-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031646041","9783031646058"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64605-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}