Level-based heuristics and hill climbing for the antibandwidth maximization problem

DOI10.1002/nla.1859zbMath1324.65077OpenAlexW1893402145MaRDI QIDQ4982954

Jennifer Scott, Yifan Hu

Publication date: 13 April 2015

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.5977

zbMATH Keywords

sparse matricesheuristic algorithmslevel setshill climbingantibandwidth maximization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

A note on computational approaches for the antibandwidth problem

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Antibandwidth of three-dimensional meshes
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Two improved algorithms for envelope and wavefront reduction
• GRASP and path relinking for the matrix bandwidth minimization.
• A Multilevel Algorithm for Wavefront Reduction
• The university of Florida sparse matrix collection
• GRASP with path relinking heuristics for the antibandwidth problem
• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
• Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
• Reducing the bandwidth of a sparse matrix with tabu search.