Scaling features in complex optimization problems

DOI10.1016/0010-4655(95)00004-YzbMath0879.90156OpenAlexW2003157686MaRDI QIDQ1359851

R. Tafelmayer, Karl Heinz Hoffmann

Publication date: 6 July 1997

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(95)00004-y

zbMATH Keywords

simulated annealingtraveling salesmanthreshold acceptingspin glass problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Optimal ensemble size for parallel implementations of simulated annealing
• Equation of State Calculations by Fast Computing Machines
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

Related Items (5)

Feature-based methods for large scale dynamic programming ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ Implementation of ensemble-based simulated annealing with dynamic load balancing under MPI ⋮ Adaptive schedules for ensemble-based threshold accepting ⋮ Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem

This page was built for publication: Scaling features in complex optimization problems