Simulated annealing and the mapping problem: A computational study
type: Item
instance of: scholarly article
title: Simulated annealing and the mapping problem: A computational study
zbMATH Open document ID: 0797.90078
DOI: 10.1016/0305-0548(94)90032-9
author: Stephen M. Hart
author: Chuen-Lung S. Chen
published in: Computers \& Operations Research
publication date: 1994-10-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 540546
zbMATH Keywords: parallel processors
zbMATH Keywords: intercommunication time
zbMATH Keywords: array of processors
zbMATH Keywords: mapping problem
zbMATH Keywords: heuristic
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90032-9
OpenAlex ID: W2046751732
cites work: The graph isomorphism disease
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Optimization by Simulated Annealing
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Simulated annealing: A tool for operational research
cites work: Convergence of an annealing algorithm
cites work: Cooling Schedules for Optimal Annealing
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
description: scientific article; zbMATH DE number 540546