Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
DOI10.1007/S10878-021-00801-6zbMATH Open1492.90187OpenAlexW3200072807MaRDI QIDQ2136166FDOQ2136166
Publication date: 10 May 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00801-6
heuristicssparse matricesmetaheuristicsorderinggraph algorithmiterated local searchbandwidth reductionrenumberingreordering algorithms
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The university of Florida sparse matrix collection
- \texttt{PQser:} a Matlab package for spectral seriation
- The NP-completeness of the bandwidth minimization problem
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Variable neighbourhood search for bandwidth reduction
- Heuristics for matrix bandwidth reduction
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- Reducing the bandwidth of a sparse matrix with tabu search.
- Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- Unravelling small world networks
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- Gradient-Based Variable Ordering of Decision Diagrams for Systems with Structural Units
Cited In (2)
Uses Software
This page was built for publication: Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136166)
