Finding exact solutions to the bandwidth minimization problem

DOI10.1007/s006070050002zbMath0946.65030OpenAlexW2014044260MaRDI 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

zbMATH Keywords

algorithmsNP-completeoptimal orderingsparse symmetric matrixbandwidth minimization

Mathematics Subject Classification ID

Related Items (9)

On bandwidth-2 graphs ⋮ Variable neighbourhood search for bandwidth reduction ⋮ Reducing the bandwidth of a sparse matrix with a genetic algorithm ⋮ Efficient iterated greedy for the two-dimensional bandwidth minimization problem ⋮ GRASP and path relinking for the matrix bandwidth minimization. ⋮ A branch and bound algorithm for the matrix bandwidth minimization ⋮ An improved simulated annealing algorithm for bandwidth minimization ⋮ A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: Finding exact solutions to the bandwidth minimization problem