Reducing the bandwidth of a sparse matrix with a genetic algorithm
From MaRDI portal
Publication:2926497
DOI10.1080/02331934.2013.830120zbMath1305.65136MaRDI QIDQ2926497
Oliviu Matei, Petrică C. Pop, Călin-Adrian Comes
Publication date: 24 October 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.830120
65F50: Computational methods for sparse matrices
68T05: Learning and adaptive systems in artificial intelligence
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- Unnamed Item
- Heuristics for matrix bandwidth reduction
- The NP-completeness of the bandwidth minimization problem
- Finding exact solutions to the bandwidth minimization problem
- 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
- A branch and bound algorithm for the matrix bandwidth minimization
- An improved simulated annealing algorithm for bandwidth minimization
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Simultaneously applying multiple mutation operators in genetic algorithms
- Reducing the bandwidth of a sparse matrix with tabu search.