Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Nonconvex programming, global optimization (90C26) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Discrete-time Markov processes on general state spaces (60J05) Integer programming (90C10) Mixed integer programming (90C11)
Recommendations
- Quantitative bounds on convergence of time-inhomogeneous Markov chains
- Merging and stability for time inhomogeneous finite Markov chains
- Study on the convergence of nonhomogeneous Markov chains with probability distance
- scientific article; zbMATH DE number 1508071
- Threshold Functions for Markov Chains: a Graph Theoretic Approach
Cited in
(12)- A simulated annealing applied for optimizing a voice-multihop radio network
- Simulation-based optimization using simulated annealing with ranking and selection
- Discrete stochastic optimization using variants of the stochastic ruler method
- A simulated annealing technique for multi-objective simulation optimization
- A modification of the stochastic ruler method for discrete stochastic optimization
- A survey on metaheuristics for stochastic combinatorial optimization
- Solution quality of random search methods for discrete stochastic optimization
- Simulated annealing in the presence of noise
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Optimal Sampling for Simulated Annealing Under Noise
- Re-use of samples in stochastic annealing
- Selecting the best stochastic system for large scale problems in DEDS.
This page was built for publication: Probabilistic search with overrides
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916486)
