Convergence of a modified algorithm of fast probabilistic modeling

DOI10.1007/s10559-008-0013-xzbMath1143.90378OpenAlexW1970358763MaRDI QIDQ946727

D. A. Gobov

Publication date: 24 September 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-008-0013-x

zbMATH Keywords

convergencecombinatorial optimizationG-algorithmprobabilistic modeling algorithm

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Uses Software

• QAPLIB

Cites Work

• Optimization by Simulated Annealing
• Metaheuristic downhill simplex method in combinatorial optimization
• Nonstationary Markov chains and convergence of the annealing algorithm
• QAPLIB - a quadratic assignment problem library
• On simulated annealing and nested annealing.
• On the convergence of generalized hill climbing algorithms
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Simulated annealing methods with general acceptance probabilities
• Cooling Schedules for Optimal Annealing
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Convergence of a modified algorithm of fast probabilistic modeling