A new matrix bandwidth reduction algorithm
From MaRDI portal
Publication:1306383
DOI10.1016/S0167-6377(98)00040-6zbMATH Open0941.90075OpenAlexW2016287305MaRDI QIDQ1306383FDOQ1306383
Authors: A. Esposito, M. S. Fiorenzo Catalano, Federico Malucelli, L. Tarricone
Publication date: 19 December 1999
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00040-6
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Title not available (Why is that?)
- A linear time algorithm for maximum matchings in convex, bipartite graphs
- The bandwidth problem for graphs and matrices—a survey
- Title not available (Why is that?)
- Solution methods and computational investigations for the linear bottleneck assignment problem
- The Profile Minimization Problem in Trees
Cited In (24)
- A branch and bound algorithm for the matrix bandwidth minimization
- An improved simulated annealing algorithm for bandwidth minimization
- A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heuristics for matrix bandwidth reduction
- Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
- A constructive bandwidth reduction algorithm
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
- Algorithm 807
- A general strategy on the bandwidth minimization (BM) problem
- On the Probable Performance of Heuristics for Bandwidth Minimization
- The bandwidths of a matrix. A survey of algorithms
- Bandwidth reduction of rectangular matrices
- A hybrid algorithm for reducing matrix bandwidth
- Modified bandwidth reduction algorithm
- Interchange opportunity in average bandwidth reduction in sparse matrices
- Title not available (Why is that?)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm
- A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
- A new node renumbering algorithm for bandwidth reduction
- A new mode renumbering algorithm for bandwidth reduction
- Variable neighbourhood search for bandwidth reduction
Uses Software
This page was built for publication: A new matrix bandwidth reduction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306383)