A STUDY OF MASSIVELY PARALLEL SIMULATED ANNEALING ALGORITHMS FOR CHROMOSOME RECONSTRUCTION VIA CLONE ORDERING

DOI10.1080/10637199608915564MaRDI QIDQ4820166zbMATH OpenOpenAlexFDO

Authors Suchendra M. Bhandakar, Sridhar Chirravuri

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199608915564

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites work

• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 41920 (Why is no real title available?)
• scientific article; zbMATH DE number 53884 (Why is no real title available?)
• scientific article; zbMATH DE number 779274 (Why is no real title available?)
• A parallel simulated annealing algorithm
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Optimization by simulated annealing
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

Describes a project that uses

Uses Software

• MPL

This page was built for publication: A STUDY OF MASSIVELY PARALLEL SIMULATED ANNEALING ALGORITHMS FOR CHROMOSOME RECONSTRUCTION VIA CLONE ORDERING

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