Reducing the bandwidth of a sparse matrix with tabu search.

DOI10.1016/S0377-2217(00)00325-8zbMath1051.90031MaRDI QIDQ5952446

Fred Glover, Manuel Laguna, Rafael Martí, Vicente Campos

Publication date: 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Tabu searchMetaheuristicsMatrix bandwidth

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Metaheuristic algorithms for the bandwidth reduction of large-scale matrices, Particle swarm optimization and hill climbing for the bandwidth minimization problem, Reducing the bandwidth of a sparse matrix with a genetic algorithm, Seeking global edges for traveling salesman problem in multi-start search, A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs, Adaptive memory programming for matrix bandwidth minimization, An evaluation of low-cost heuristics for matrix bandwidth and profile reductions, Data-Mining-Driven Neighborhood Search, Level-based heuristics and hill climbing for the antibandwidth maximization problem, GRASP with path relinking heuristics for the antibandwidth problem, Addressing the envelope reduction of sparse matrices using a genetic programming system, A general variable neighborhood search for the cyclic antibandwidth problem

Uses Software

• Harwell-Boeing sparse matrix collection
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Greedy randomized adaptive search procedures
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A Comparison of Several Bandwidth and Profile Reduction Algorithms