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

DOI10.1007/S10589-014-9688-2MaRDI QIDQ2352428zbMATH OpenOpenAlexWikidataFDO

Authors Behrooz Koohestani, Riccardo Poli

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 matricescombinatorial optimisationgenetic programmingenvelope reduction problemgraph labelling

Mathematics Subject Classification ID

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

Recommendations

• Reducing the bandwidth of a sparse matrix with a genetic algorithm
• Improving parallel ordering of sparse matrices using genetic algorithms
• A spectral algorithm for envelope reduction of sparse matrices
• Genetic programming and randomized algorithms for estimation of singulars values of large matrices
• A generalized envelope method for sparse factorization by rows

Cites work

• scientific article; zbMATH DE number 3852305 (Why is no real title available?)
• scientific article; zbMATH DE number 3553634 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2040688 (Why is no real title available?)
• scientific article; zbMATH DE number 795587 (Why is no real title available?)
• scientific article; zbMATH DE number 1442000 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A FORTRAN program for profile and wavefront reduction
• A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
• A frontal solution program for finite element analysis
• A multilevel algorithm for wavefront reduction
• A spectral algorithm for envelope reduction of sparse matrices
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• An improved simulated annealing algorithm for bandwidth minimization
• Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
• GRASP and path relinking for the matrix bandwidth minimization.
• Heuristics for matrix bandwidth reduction
• Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
• Implementing Hager's exchange methods for matrix profile reduction
• Minimizing the profile of a symmetric matrix
• Near-minimal matrix profiles and wavefronts for testing nodal resequencing algorithms
• Old and new results on algebraic connectivity of graphs
• Particle swarm optimization and hill climbing for the bandwidth minimization problem
• Profile minimization problem for matrices and graphs
• Reducing the bandwidth of a sparse matrix with tabu search.
• The use of profile reduction algorithms with a frontal code
• Two improved algorithms for envelope and wavefront reduction
• Variable neighbourhood search for bandwidth reduction

Cited in

(1)

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

Describes a project that uses

Uses Software

• profile wavefront
• Tabu search

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

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