Heuristics for matrix bandwidth reduction

DOI10.1016/J.EJOR.2005.02.066MaRDI QIDQ858330zbMATH OpenOpenAlexFDO

Authors Brian Rodrigues, Fei Xiao, Andrew Lim

Publication date 9 January 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.02.066

zbMATH Keywords

genetic algorithmhill climbingmatrix bandwidthnode adjustments

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)

Recommendations

• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• A new matrix bandwidth reduction algorithm
• Reducing the bandwidth of a sparse matrix with a genetic algorithm
• Reducing the bandwidth of a sparse matrix with tabu search.
• Metaheuristic algorithms for the bandwidth reduction of large-scale matrices

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 1330399 (Why is no real title available?)
• scientific article; zbMATH DE number 2079803 (Why is no real title available?)
• scientific article; zbMATH DE number 953009 (Why is no real title available?)
• scientific article; zbMATH DE number 798643 (Why is no real title available?)
• scientific article; zbMATH DE number 3410504 (Why is no real title available?)
• A Comparison of Several Bandwidth and Profile Reduction Algorithms
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Complexity Results for Bandwidth Minimization
• GRASP and path relinking for the matrix bandwidth minimization.
• Greedy randomized adaptive search procedures
• The NP-completeness of the bandwidth minimization problem
• The bandwidth problem for graphs and matrices—a survey

Cited in

(16)

• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• Addressing the envelope reduction of sparse matrices using a genetic programming system
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• Variable neighbourhood search for bandwidth reduction
• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
• Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
• A hybrid technique bandwidth problem for a matrix
• scientific article; zbMATH DE number 798643 (Why is no real title available?)
• Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
• A hybrid algorithm for reducing matrix bandwidth
• Reducing the bandwidth of a sparse matrix with tabu search.
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• scientific article; zbMATH DE number 2040688 (Why is no real title available?)
• Bandwidth reduction of rectangular matrices
• Reducing the bandwidth of a sparse matrix with a genetic algorithm
• Adaptive memory programming for matrix bandwidth minimization

Describes a project that uses

Uses Software

• Tabu search
• symrcm

This page was built for publication: Heuristics for matrix bandwidth reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858330)