A hybrid algorithm for reducing matrix bandwidth
From MaRDI portal
Recommendations
- A new matrix bandwidth reduction algorithm
- Algorithms for the reduction of matrix bandwidth and profile
- Heuristics for matrix bandwidth reduction
- A hybrid technique bandwidth problem for a matrix
- Algorithms for reducing the bandwidth and profile of a sparse matrix
- Bandwidth reduction in sparse matrices
- Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
- Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
- A branch and bound algorithm for the matrix bandwidth minimization
- Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy
Cited in
(10)- GRASP and path relinking for the matrix bandwidth minimization.
- Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
- Bandwidth reduction of rectangular matrices
- Ordering for bandwidth reduction
- Modified bandwidth reduction algorithm
- A new mode renumbering algorithm for bandwidth reduction
- scientific article; zbMATH DE number 4037041 (Why is no real title available?)
- Bandwidth reduction by simulated annealing
- scientific article; zbMATH DE number 1369410 (Why is no real title available?)
- Reducing the bandwidth of a sparse matrix with tabu search.
This page was built for publication: A hybrid algorithm for reducing matrix bandwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340028)