Finding exact solutions to the bandwidth minimization problem
From MaRDI portal
Publication:1300222
DOI10.1007/s006070050002zbMath0946.65030MaRDI QIDQ1300222
Gianna M. Del Corso, Giovanni Manzini
Publication date: 17 October 2000
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s006070050002
65F50: Computational methods for sparse matrices
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
A survey of direct methods for sparse linear systems, Efficient iterated greedy for the two-dimensional bandwidth minimization problem, A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs, On bandwidth-2 graphs, GRASP and path relinking for the matrix bandwidth minimization., Variable neighbourhood search for bandwidth reduction, A branch and bound algorithm for the matrix bandwidth minimization, An improved simulated annealing algorithm for bandwidth minimization, Reducing the bandwidth of a sparse matrix with a genetic algorithm