Reducing the bandwidth of a sparse matrix with tabu search.

DOI10.1016/S0377-2217(00)00325-8MaRDI QIDQ5952446zbMATH OpenFDO

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

Publication date 2001

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

Full work available at URL https://doi.org/10.1016/S0377-2217(00)00325-8

zbMATH Keywords

Matrix bandwidthMetaheuristicsTabu search

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for reducing the bandwidth and profile of a sparse matrix
• Bandwidth reduction in sparse matrices
• Reducing the bandwidth of a sparse matrix with a genetic algorithm
• scientific article; zbMATH DE number 4037041
• Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
• Heuristics for matrix bandwidth reduction
• Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
• Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
• A hybrid algorithm for reducing matrix bandwidth
• scientific article; zbMATH DE number 4090692

Cites work

• A Comparison of Several Bandwidth and Profile Reduction Algorithms
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 798643 (Why is no real title available?)

Cited in

(19)

• A general variable neighborhood search for the cyclic antibandwidth problem
• Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
• Addressing the envelope reduction of sparse matrices using a genetic programming system
• Variable neighbourhood search for bandwidth reduction
• Particle swarm optimization and hill climbing for the bandwidth minimization problem
• A branch and bound algorithm for the matrix bandwidth minimization
• Data-mining-driven neighborhood search
• Interchange opportunity in average bandwidth reduction in sparse matrices
• Reducing the bandwidth of a sparse matrix with a genetic algorithm
• The bandwidths of a matrix. A survey of algorithms
• GRASP with path relinking heuristics for the antibandwidth problem
• scientific article; zbMATH DE number 1330399 (Why is no real title available?)
• Nodal ordering for bandwidth reduction using ant system algorithm
• Level-based heuristics and hill climbing for the antibandwidth maximization problem
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• Adaptive memory programming for matrix bandwidth minimization
• Seeking global edges for traveling salesman problem in multi-start search
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• Heuristics for matrix bandwidth reduction

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection
• Tabu search

This page was built for publication: Reducing the bandwidth of a sparse matrix with tabu search.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952446)