A parallel simulated annealing algorithm

DOI10.1016/0167-8191(93)90070-2zbMath0780.65032OpenAlexW2044242149MaRDI QIDQ688194

Nicolas Boissin, Jean-Luc Lutton

Publication date: 23 January 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90070-2

zbMATH Keywords

convergencecombinatorial optimizationparallel computerminimization of an unconstrained 0-1 quadratic functionquadratic sum assignment problemsequential simulated annealing algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (3)

A STUDY OF MASSIVELY PARALLEL SIMULATED ANNEALING ALGORITHMS FOR CHROMOSOME RECONSTRUCTION VIA CLONE ORDERING ⋮ An analysis of parallel heuristics for task allocation in multicomputers ⋮ Metaheuristics: A bibliography

This page was built for publication: A parallel simulated annealing algorithm