Accelerating the convergence of random search methods for discrete stochastic optimization
From MaRDI portal
Publication:4575347
Recommendations
Cited in
(18)- Solution quality of random search methods for discrete stochastic optimization
- scientific article; zbMATH DE number 5221408 (Why is no real title available?)
- Estimates of the rate of convergence of a method of seeking the most preferable element
- Penalty function with memory for discrete optimization via simulation with stochastic constraints
- A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
- Accelerating Stochastic Composition Optimization
- Stochastic Comparison Algorithm for Discrete Optimization with Estimation
- Discrete stochastic optimization using variants of the stochastic ruler method
- On the convergence of the Baba and Dorea random optimization methods
- Stochastic Discrete Optimization
- Multi-objective simulation-based evolutionary algorithm for an aircraft spare parts allocation problem
- Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation
- An Asymptotically Optimal Set Approach for Simulation Optimization
- Stochastic comparison algorithm for discrete optimization with estimation of time-varying objective functions
- A modified Hooke and Jeeves algorithm with likelihood ratio performance extrapolation for simulation optimization
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
- scientific article; zbMATH DE number 1961527 (Why is no real title available?)
- On modification of population-based search algorithms for convergence in stochastic combinatorial optimization
This page was built for publication: Accelerating the convergence of random search methods for discrete stochastic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575347)