A new matrix bandwidth reduction algorithm

DOI10.1016/S0167-6377(98)00040-6MaRDI QIDQ1306383zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph partitioningbottleneck assignmentmatrix bandwith reductionnode renumbering

Mathematics Subject Classification ID

Mathematical programming (90C99)

Recommendations

• A constructive bandwidth reduction algorithm
• A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
• A branch and bound algorithm for the matrix bandwidth minimization
• Heuristics for matrix bandwidth reduction
• scientific article; zbMATH DE number 1330399

Cites work

• scientific article; zbMATH DE number 3943253 (Why is no real title available?)
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 1330399 (Why is no real title available?)
• A linear time algorithm for maximum matchings in convex, bipartite graphs
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Network flows. Theory, algorithms, and applications.
• Solution methods and computational investigations for the linear bottleneck assignment problem
• The Profile Minimization Problem in Trees
• The bandwidth problem for graphs and matrices—a survey

Cited in

(24)

• The bandwidths of a matrix. A survey of algorithms
• A new node renumbering algorithm for bandwidth reduction
• scientific article; zbMATH DE number 4037041 (Why is no real title available?)
• scientific article; zbMATH DE number 4090692 (Why is no real title available?)
• Variable neighbourhood search for bandwidth reduction
• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
• scientific article; zbMATH DE number 3866470 (Why is no real title available?)
• A new mode renumbering algorithm for bandwidth reduction
• Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
• Modified bandwidth reduction algorithm
• Heuristics for matrix bandwidth reduction
• A hybrid algorithm for reducing matrix bandwidth
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• A general strategy on the bandwidth minimization (BM) problem
• Bandwidth reduction of rectangular matrices
• A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
• Algorithm 807
• On the Probable Performance of Heuristics for Bandwidth Minimization
• Interchange opportunity in average bandwidth reduction in sparse matrices
• A constructive bandwidth reduction algorithm
• Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
• Reducing the bandwidth of a sparse matrix with a genetic algorithm
• A branch and bound algorithm for the matrix bandwidth minimization
• An improved simulated annealing algorithm for bandwidth minimization

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection

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)