Simulated annealing and the mapping problem: A computational study
From MaRDI portal
Publication:1318465
DOI10.1016/0305-0548(94)90032-9zbMath0797.90078MaRDI QIDQ1318465
Chuen-Lung S. Chen, Stephen M. Hart
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
simulated annealing; heuristic; parallel processors; mapping problem; array of processors; intercommunication time
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
90C27: Combinatorial optimization
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A simulated annealing heuristic for the one-dimensional cutting stock problem, Metaheuristics: A bibliography
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