Mladenovic, Nenad; Urosevic, Dragan; Pérez-Brito, Dionisio - In: European Journal of Operational Research 200 (2010) 1, pp. 14-27
The problem of reducing the bandwidth of a matrix consists of finding a permutation of rows and columns of a given matrix which keeps the non-zero elements in a band as close as possible to the main diagonal. This NP-complete problem can also be formulated as a vertex labelling problem on a...