Simulated annealing methods with general acceptance probabilities
From MaRDI portal
Recommendations
Cited in
(49)- On the convergence of stationary distributions in simulated annealing algorithms
- A note on the effect of neighborhood structure in simulated annealing
- Optimal design of LAN-WAN internetworks: An approach using simulated annealing
- Optimizing simulated annealing schedules with genetic programming
- Stochastic annealing for synthesis under uncertainty
- A systematic procedure for setting parameters in simulated annealing algorithms
- A statistical analysis of simulated annealing applied to the p-median problem
- On the convergence of generalized hill climbing algorithms
- Bounding the probability of success of stochastic methods for global optimization
- Some new results on simulated annealing applied to the job shop scheduling problem
- Convergence of a simulation method for solution of combinatorial optimization problems
- Metaheuristics: A bibliography
- Sequential Monte Carlo simulated annealing
- Quantum annealing learning search for solving QUBO problems
- On weak and strong ergodicity
- The influence of problem specific neighborhood structures in metaheuristics performance
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- Stochastic optimization using simulated annealing with hypothesis test
- A theoretical framework for simulated annealing
- Mean convergence time of inhomogeneous genetic algorithm with elitism
- Averaging frameworks for simulation optimization with applications to simulated annealing
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- Simulated annealing in compound Gaussian random fields (image processing)
- Optimal acceptance probability for simulated annealing
- On the Ergodicity of Slow-Varying Nonstationary Markov Chains
- scientific article; zbMATH DE number 4039157 (Why is no real title available?)
- Simulated annealing: An introduction
- scientific article; zbMATH DE number 109596 (Why is no real title available?)
- Simple conditions for the convergence of simulated annealing type algorithms
- scientific article; zbMATH DE number 1304351 (Why is no real title available?)
- Classification of Acceptance Criteria for the Simulated Annealing Algorithm
- Classical Model Selection via Simulated Annealing
- Computational Experience with Generalized Simulated Annealing Over Continuous Variables
- CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION
- Convergence of a random algorithm for function optimization
- Convergence of Simulated Annealing with Feedback Temperature Schedules
- Theory of genetic algorithms
- Finite-time performance analysis of static simulated annealing algorithms
- Annealing a genetic algorithm for constrained optimization
- An exact D-dimensional Tsallis random number generator for generalized simulated annealing
- Combinatorial optimization by stochastic automata
- Algorithms for the maximum satisfiability problem
- Performance analysis of cyclical simulated annealing algorithms
- Using simulated annealing to optimize the feature selection problem in marketing applications
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Simulated annealing: A tool for operational research
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- Convergence of a modified algorithm of fast probabilistic modeling
This page was built for publication: Simulated annealing methods with general acceptance probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3764964)
