Selecting a Selection Procedure

DOI10.1287/mnsc.1070.0721zbMath1232.62042OpenAlexW2122470810MaRDI QIDQ3116157

Christian Schmidt, Juergen Branke, Stephen E. Chick

Publication date: 21 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.1070.0721

zbMATH Keywords

samplingsimulations

Mathematics Subject Classification ID

Related Items (39)

Genetic-algorithm-based simulation optimization considering a single stochastic constraint ⋮ Top-\(\kappa\) selection with pairwise comparisons ⋮ Dynamic Sampling Allocation and Design Selection ⋮ Rapid screening algorithms for stochastically constrained problems ⋮ A Fully Sequential Elimination Procedure for Indifference-Zone Ranking and Selection with Tight Bounds on Probability of Correct Selection ⋮ Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination ⋮ Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures ⋮ Optimal computing budget allocation for the vector evaluated genetic algorithm in multi-objective simulation optimization ⋮ Optimal computing budget allocation for regression with gradient information ⋮ Robust ranking and selection with optimal computing budget allocation ⋮ Simulation budget allocation for simultaneously selecting the best and worst subsets ⋮ An efficient simulation procedure for the expected opportunity cost using metamodels ⋮ Information theory for ranking and selection ⋮ Convergence rate analysis for optimal computing budget allocation algorithms ⋮ Indifference-Zone-Free Selection of the Best ⋮ On the Convergence Rates of Expected Improvement Methods ⋮ Computing budget allocation rules for multi-objective simulation models based on different measures of selection quality ⋮ Unnamed Item ⋮ Discriminating the nature of thyroid nodules using the hybrid method ⋮ A New Budget Allocation Framework for the Expected Opportunity Cost ⋮ Efficient Ranking and Selection in Parallel Computing Environments ⋮ Finite-Time Analysis for the Knowledge-Gradient Policy ⋮ Unnamed Item ⋮ An efficient simulation budget allocation method incorporating regression for partitioned domains ⋮ An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints ⋮ Efficient solution selection for two-stage stochastic programs ⋮ Considering sample means in Rinott's procedure with a Bayesian approach ⋮ Bayesian Optimization via Simulation with Pairwise Sampling and Correlated Prior Beliefs ⋮ Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments ⋮ Complete expected improvement converges to an optimal budget allocation ⋮ Efficient simulation budget allocation for ranking the top \(m\) designs ⋮ Constrained optimization in expensive simulation: novel approach ⋮ A quantile-based approach to system selection ⋮ Efficient Sampling Allocation Procedures for Optimal Quantile Selection ⋮ Efficient estimation of a risk measure requiring two-stage simulation optimization ⋮ An accelerated stopping rule for the nested partition hybrid algorithm for discrete stochastic optimization ⋮ Optimal budget allocation policy for tabu search in stochastic simulation optimization ⋮ Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data ⋮ Stochastically Constrained Ranking and Selection via SCORE

This page was built for publication: Selecting a Selection Procedure