Arrangement, Antibandwidth & Bandwidth

If you are working on the Bandwidth problem, you can use the following sets of instances:


As far as we know this file contains good solutions and lower bounds for this problem.

Papers

VNS with Ejection Chains for the Antibandwidth Problem
M. Lozano, A. Duarte, F. Gortázar and R. Martí, Technical Report, June 2011

Scatter search and Path Relinking. A tutorial on the Linear Arrangement
R. Martí, J. Pantrigo, A. Duarte, V. Campos and F. Glover, International Journal of Swarm Intelligence Research To appear

GRASP with PR heuristics for the antibandwidth problem
A. Duarte, R. Martí, M.G.C. Resende and R.M.A. Silva, Networks, To appear

Heuristics for the bandwidth colouring problem
R. Martí, F. Gortazar and A. Duarte, International Journal of MetaHeuristics 1(1), 11-29 (2010)

Adaptive Memory Programming for Matrix Bandwidth Minimization
V. Campos, E. Piņana and R. Martí, Annals of Operations Research 183, 7-23 (2011).

Branch and Bound for the Matrix Bandwidth Minimization
R. Martí, V. Campos and E. Piņana, European Journal of Operational Research 186, 513-528 (2008).

GRASP and Path Relinking for the Matrix Bandwidth Minimization
E. Piņana, I. Plana, V. Campos y R. Martí, European Journal of Operational Research 153, 200-210 (2004).

Reducing the Bandwidth of a Sparse Matrix with Tabu Search
Rafael Martí, Manuel Laguna, Fred Glover and Vicente Campos, European Journal of Operational Research, 135 (2), 211-220 (2001)