Convergence of a modified algorithm of fast probabilistic modeling
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3801290 (Why is no real title available?)
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- Cooling Schedules for Optimal Annealing
- Metaheuristic downhill simplex method in combinatorial optimization
- Nonstationary Markov chains and convergence of the annealing algorithm
- On simulated annealing and nested annealing.
- On the convergence of generalized hill climbing algorithms
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Optimization by simulated annealing
- QAPLIB - a quadratic assignment problem library
- Simulated annealing methods with general acceptance probabilities
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
This page was built for publication: Convergence of a modified algorithm of fast probabilistic modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946727)