Bandwidth reduction by simulated annealing

DOI10.1002/NME.1620372304MaRDI QIDQ4326300zbMATH OpenOpenAlexFDO

Authors Eduardo J. Dubuc

Publication date 24 October 1995

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nme.1620372304

zbMATH Keywords

algorithmbandwidth reductionconvergenceCuthill-McKee algorithmEverstine problemsMonte Carlo runssimulated annealing

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

Recommendations

• An improved simulated annealing algorithm for bandwidth minimization
• scientific article; zbMATH DE number 798643
• scientific article; zbMATH DE number 1163755
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• A hybrid algorithm for reducing matrix bandwidth

Cited in

(6)

• Metaheuristics: A bibliography
• An improved simulated annealing algorithm for bandwidth minimization
• Simulated annealing for profile and fill reduction of sparse matrices
• scientific article; zbMATH DE number 1163755 (Why is no real title available?)
• scientific article; zbMATH DE number 798643 (Why is no real title available?)
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs

This page was built for publication: Bandwidth reduction by simulated annealing

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