Addressing the envelope reduction of sparse matrices using a genetic programming system

DOI10.1007/s10589-014-9688-2zbMath1326.90072OpenAlexW2011302786WikidataQ58475488 ScholiaQ58475488MaRDI QIDQ2352428

Riccardo Poli, Behrooz Koohestani

Publication date: 1 July 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-014-9688-2

zbMATH Keywords

sparse matricesgraph labellinggenetic programmingcombinatorial optimisationenvelope reduction problem

Mathematics Subject Classification ID

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

Related Items (1)

A variable neighborhood search and simulated annealing hybrid for the profile minimization problem

Uses Software

• Tabu search
• profile wavefront

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for matrix bandwidth reduction
• Old and new results on algebraic connectivity of graphs
• Profile minimization problem for matrices and graphs
• Two improved algorithms for envelope and wavefront reduction
• GRASP and path relinking for the matrix bandwidth minimization.
• Variable neighbourhood search for bandwidth reduction
• Particle swarm optimization and hill climbing for the bandwidth minimization problem
• An improved simulated annealing algorithm for bandwidth minimization
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• A Multilevel Algorithm for Wavefront Reduction
• Minimizing the Profile of a Symmetric Matrix
• Near-minimal matrix profiles and wavefronts for testing nodal resequencing algorithms
• Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
• A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
• An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
• A spectral algorithm for envelope reduction of sparse matrices
• The use of profile reduction algorithms with a frontal code
• A FORTRAN program for profile and wavefront reduction
• Implementing Hager's exchange methods for matrix profile reduction
• A frontal solution program for finite element analysis
• Reducing the bandwidth of a sparse matrix with tabu search.

This page was built for publication: Addressing the envelope reduction of sparse matrices using a genetic programming system