Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy

DOI10.1051/RO/2021102OpenAlexW3178119113MaRDI QIDQ5158306

Libério M. Silva, Sanderson L. Gonzaga de Oliveira

Publication date: 21 October 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2021102

zbMATH Keywords

orderinggraph algorithmsparse matrixgraph labelingant colony optimizationbandwidth reductionhyper-heuristicrenumberingreordering algorithmslocal search procedurehill-climbing procedure

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Combinatorial optimization (90C27) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy