Reducing the bandwidth of a sparse matrix with a genetic algorithm
type: Item
instance of: scholarly article
title: Reducing the bandwidth of a sparse matrix with a genetic algorithm
zbMATH Open document ID: 1305.65136
DOI: 10.1080/02331934.2013.830120
author: Petrica Pop
author: Oliviu Matei
author: Călin-Adrian Comes
published in: Optimization
publication date: 2014-10-24T00:00:00Z
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6361533
zbMATH Keywords: bandwidth minimization problem
zbMATH Keywords: heuristics and genetic algorithms
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331934.2013.830120
OpenAlex ID: W1985076025
cites work: The NP-completeness of the bandwidth minimization problem
cites work: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
cites work: Finding exact solutions to the bandwidth minimization problem
cites work: Reducing the bandwidth of a sparse matrix with tabu search.
cites work: GRASP and path relinking for the matrix bandwidth minimization.
cites work: Heuristics for matrix bandwidth reduction
cites work: Particle swarm optimization and hill climbing for the bandwidth minimization problem
cites work: An improved simulated annealing algorithm for bandwidth minimization
cites work: Variable neighbourhood search for bandwidth reduction
cites work: Simultaneously applying multiple mutation operators in genetic algorithms
cites work: Q4331755
cites work: A branch and bound algorithm for the matrix bandwidth minimization
description: scientific article; zbMATH DE number 6361533