Heuristics for matrix bandwidth reduction

DOI10.1016/j.ejor.2005.02.066zbMath1116.90118OpenAlexW1967828505MaRDI QIDQ858330

Fei Xiao, Brian Rodrigues, Andrew E. B. 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)

Related Items

Metaheuristic algorithms for the bandwidth reduction of large-scale matrices, Variable neighbourhood search for bandwidth reduction, Reducing the bandwidth of a sparse matrix with a genetic algorithm, A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs, A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs, Adaptive memory programming for matrix bandwidth minimization, The minimization of open stacks problem: a review of some properties and their use in pre-processing operations, Addressing the envelope reduction of sparse matrices using a genetic programming system

Uses Software

• Tabu search
• symrcm

Cites Work

• The NP-completeness of the bandwidth minimization problem
• GRASP and path relinking for the matrix bandwidth minimization.
• Greedy randomized adaptive search procedures
• The bandwidth problem for graphs and matrices—a survey
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A Comparison of Several Bandwidth and Profile Reduction Algorithms
• Complexity Results for Bandwidth Minimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item