Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms

DOI10.1016/0377-2217(94)00058-KzbMath0914.90198MaRDI QIDQ1390245

Alain Sutter, Pierre Chardaire, Jean-Luc Lutton

Publication date: 14 July 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealingheuristictravelling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

Metaheuristics: A bibliography ⋮ Boosting quantum annealer performance via sample persistence ⋮ Attacks of simple block ciphers via efficient heuristics ⋮ Hybrid Metaheuristics: An Introduction ⋮ Hill Climbing Algorithms and Trivium ⋮ Metaheuristics in combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Persistency in quadratic 0-1 optimization
• Minimization of a quadratic pseudo-Boolean function
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Equation of State Calculations by Fast Computing Machines
• Computer Solutions of the Traveling Salesman Problem
• Time-Dependent Statistics of the Ising Model