Solving Large-Scale Fixed-Budget Ranking and Selection Problems
From MaRDI portal
Recommendations
- Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
- Efficient ranking and selection in parallel computing environments
- Predicting the simulation budget in ranking and selection procedures
Cites work
- scientific article; zbMATH DE number 2089367 (Why is no real title available?)
- scientific article; zbMATH DE number 3527652 (Why is no real title available?)
- A Knowledge-Gradient Policy for Sequential Information Collection
- A Sequential Procedure for Selecting the Population with the Largest Mean from k Normal Populations
- A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
- A confidence interval procedure for expected shortfall risk measurement via two-level simulation
- A fully sequential procedure for indifference-zone selection in simulation
- Efficient ranking and selection in parallel computing environments
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Indifference-Zone-Free Selection of the Best
- Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
- On the convergence rates of expected improvement methods
- On two-stage selection procedures and related probability-inequalities
- Ranking and Selection with Covariates for Personalized Decision Making
- Sequential sampling to myopically maximize the expected value of information
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
- Stochastic models of manufacturing systems.
Cited in
(6)- A budget-adaptive allocation rule for optimal computing budget allocation
- Predicting the simulation budget in ranking and selection procedures
- Fifty years of stochastic simulation: where we are and where we need to go
- Parallel Adaptive Survivor Selection
- Simulation budget allocation for improving scheduling and routing of automated guided vehicles in warehouse management
- Review of large-scale simulation optimization
This page was built for publication: Solving Large-Scale Fixed-Budget Ranking and Selection Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060777)
