Simulated annealing and the mapping problem: A computational study

DOI10.1016/0305-0548(94)90032-9zbMath0797.90078OpenAlexW2046751732MaRDI QIDQ1318465

Stephen M. Hart, Chuen-Lung S. Chen

Publication date: 25 October 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90032-9

zbMATH Keywords

simulated annealingheuristicparallel processorsmapping problemarray of processorsintercommunication time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Metaheuristics: A bibliography ⋮ Simulated annealing for optimal ship routing ⋮ A simulated annealing heuristic for the one-dimensional cutting stock problem

Cites Work

• Optimization by Simulated Annealing
• Simulated annealing: A tool for operational research
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing
• The graph isomorphism disease
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Simulated annealing and the mapping problem: A computational study