Convergence in Probability of Compressed Annealing

DOI10.1287/MOOR.1040.0095zbMATH Open1082.90101OpenAlexW2149535940MaRDI QIDQ5704201FDOQ5704201

Authors: Jeffrey W. Ohlmann, James C. Bean, Shane G. Henderson 

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1040.0095

Recommendations

• Optimization by simulated annealing: a necessary and sufficient condition for convergence
• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing
• On simulated annealing and nested annealing.
• Convergence and finite-time behavior of simulated annealing

zbMATH Keywords

simulated annealingpenalty methodsconstrained combinatorial optimization

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Numerical optimization and variational techniques (65K10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial optimization (90C27)

Cited In (5)

• From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
• Scheduled penalty variable neighborhood search
• Operational aircraft maintenance routing problem with remaining time consideration
• Annealing a genetic algorithm for constrained optimization
• Title not available (Why is that?)

This page was built for publication: Convergence in Probability of Compressed Annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704201)