Convergence in Probability of Compressed Annealing

DOI10.1287/moor.1040.0095zbMath1082.90101OpenAlexW2149535940MaRDI QIDQ5704201

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

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

zbMATH Keywords

simulated annealingpenalty methodsconstrained combinatorial optimization

Mathematics Subject Classification ID

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

Related Items

Scheduled penalty variable neighborhood search ⋮ Annealing a genetic algorithm for constrained optimization ⋮ From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ Unnamed Item ⋮ Operational aircraft maintenance routing problem with remaining time consideration