An evaluation of low-cost heuristics for matrix bandwidth and profile reductions

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorOliveira, Sanderson L. Gonzaga de-
Autor(es): dc.creatorBernardes, Júnior A. B.-
Autor(es): dc.creatorChagas, Guilherme O.-
Data de aceite: dc.date.accessioned2026-02-09T11:39:53Z-
Data de disponibilização: dc.date.available2026-02-09T11:39:53Z-
Data de envio: dc.date.issued2019-06-12-
Data de envio: dc.date.issued2019-06-12-
Data de envio: dc.date.issued2018-05-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/34726-
Fonte completa do material: dc.identifierhttps://link.springer.com/article/10.1007/s40314-016-0394-9-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1144692-
Descrição: dc.descriptionHundreds of heuristics have been proposed to resolve the problems of bandwidth and profile reductions since the 1960s. We found 132 heuristics that have been applied to these problems in reviews of the literature. Among them, 14 were selected for which no other simulation or comparison revealed that the heuristic could be superseded by any other algorithm in the analyzed articles with respect to bandwidth or profile reduction. We also considered the computational costs of the heuristics during this process. Therefore, these 14 heuristics were selected as potentially being the best low-cost methods to solve the bandwidth and/or profile reduction problems. Results of the 14 selected heuristics are evaluated in this work. For evaluation on the set of test problems, a metric based on the relative percentage distance to the best possible bandwidth or profile is proposed. The most promising heuristics for several application areas are identified. Moreover, it was found that the FNCHC and GPS heuristics showed the best overall results in reducing the bandwidth of symmetric and asymmetric matrices among the evaluated heuristics, respectively. In addition, the NSloan and MPG heuristics showed the best overall results in reducing the profile of symmetric and asymmetric matrices among the heuristics among the evaluated heuristics, respectively.-
Idioma: dc.languageen-
Publicador: dc.publisherSpringer-
Direitos: dc.rightsrestrictAccess-
???dc.source???: dc.sourceComputational and Applied Mathematics-
Palavras-chave: dc.subjectBandwidth reduction-
Palavras-chave: dc.subjectProfile reduction-
Palavras-chave: dc.subjectCombinatorial optimization-
Palavras-chave: dc.subjectEnvelope reduction problem-
Palavras-chave: dc.subjectHeuristics-
Palavras-chave: dc.subjectMetaheuristics-
Palavras-chave: dc.subjectReordering algorithms-
Palavras-chave: dc.subjectSparse matrices-
Palavras-chave: dc.subjectReordering algorithms-
Palavras-chave: dc.subjectRenumbering-
Palavras-chave: dc.subjectOrdering-
Palavras-chave: dc.subjectGraph labeling-
Palavras-chave: dc.subjectBandwidth minimization-
Título: dc.titleAn evaluation of low-cost heuristics for matrix bandwidth and profile reductions-
Tipo de arquivo: dc.typeArtigo-
Aparece nas coleções:Repositório Institucional da Universidade Federal de Lavras (RIUFLA)

Não existem arquivos associados a este item.