Solution quality of random search methods for discrete stochastic optimization
From MaRDI portal
Recommendations
- Accelerating the convergence of random search methods for discrete stochastic optimization
- Stochastic Discrete Optimization
- A Global Search Method for Discrete Stochastic Optimization
- Adaptive random search for continuous simulation optimization
- A framework for locally convergent random-search algorithms for discrete optimization via simulation
Cites work
- A Global Search Method for Discrete Stochastic Optimization
- A Method for Discrete Stochastic Optimization
- A modification of the stochastic ruler method for discrete stochastic optimization
- A simulated annealing algorithm with constant temperature for discrete stochastic optimization
- Convergence and finite-time behavior of simulated annealing
- Cooling Schedules for Optimal Annealing
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 1990830 (Why is no real title available?)
- Nested partitions method for stochastic optimization
- On two-stage selection procedures and related probability-inequalities
- Optimization by simulated annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Probabilistic search with overrides
- Selecting the best stochastic system for large scale problems in DEDS.
- Simulated annealing for discrete optimization with estimation
- Simulated annealing for noisy cost functions
- Simulated annealing with noisy or imprecise energy measurements
- Simulation-based optimization using simulated annealing with ranking and selection
- Stochastic Discrete Optimization
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The sample average approximation method for stochastic discrete optimization
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(7)- Confidence sets for discrete stochastic optimization
- Assessing solution quality in stochastic programs
- Use of random search in solving discrete extremal problems
- Selecting the best simulated system with weighted control-variate estimators
- A framework for locally convergent random-search algorithms for discrete optimization via simulation
- Accelerating the convergence of random search methods for discrete stochastic optimization
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Solution quality 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 Q1780464)