An ant colony hyperheuristic approach for matrix bandwidth reduction
Authors:
- S.L. Gonzaga de OliveiraSOS.L. Gonzaga de Oliveira
- L.M. SilvaLSL.M. Silva
- 1 September 2020
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 94
Abstract
No abstract availableKeywords
Funding Information
- Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
This publication has 25 references indexed in Scilit:
- Hybrid ant models with a transition policy for solving a complex problemLogic Journal of the IGPL, 2011
- Variable neighbourhood search for bandwidth reductionEuropean Journal of Operational Research, 2010
- Nodal ordering for bandwidth reduction using ant system algorithmEngineering Computations, 2009
- A FAST ALGORITHM FOR BANDWIDTH MINIMIZATIONInternational Journal on Artificial Intelligence Tools, 2007
- Ant colony optimization with hill climbing for the bandwidth minimization problemApplied Soft Computing, 2005
- Unravelling small world networksJournal of Computational and Applied Mathematics, 2003
- Sparse Matrices in MATLAB: Design and ImplementationSIAM Journal on Matrix Analysis and Applications, 1992
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- The NP-Completeness of the bandwidth minimization problemComputing, 1976
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse MatrixSIAM Journal on Numerical Analysis, 1976