Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
From MaRDI portal
Publication:2136166
Recommendations
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 953009 (Why is no real title available?)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- 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
- Heuristics for matrix bandwidth reduction
- Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
- Reducing the bandwidth of a sparse matrix with tabu search.
- The NP-completeness of the bandwidth minimization problem
- The University of Florida sparse matrix collection
- Unravelling small world networks
- Variable neighbourhood search for bandwidth reduction
- \texttt{PQser:} a Matlab package for spectral seriation
Cited in
(6)- Nodal ordering for bandwidth reduction using ant system algorithm
- Particle swarm optimization and hill climbing for the bandwidth minimization problem
- Heuristics for matrix bandwidth reduction
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
- Bandwidth reduction in sparse matrices
- Reducing the bandwidth of a sparse matrix with tabu search.
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)
