Adaptive memory programming for matrix bandwidth minimization

DOI10.1007/s10479-009-0573-9zbMath1213.90208OpenAlexW2144653000MaRDI QIDQ541991

Vicente Campos, Estefanía Piñana, Rafael Martí

Publication date: 8 June 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-009-0573-9

zbMATH Keywords

tabu searchheuristic searchscatter searchmemory programming

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A variable neighborhood search and simulated annealing hybrid for the profile minimization problem, Population-based iterated greedy algorithm for the S-labeling problem, A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for matrix bandwidth reduction
• The NP-completeness of the bandwidth minimization problem
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• GRASP and path relinking for the matrix bandwidth minimization.
• An experimental evaluation of a scatter search for the linear ordering problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• A branch and bound algorithm for the matrix bandwidth minimization
• An improved simulated annealing algorithm for bandwidth minimization
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Reducing the bandwidth of a sparse matrix with tabu search.