Pages that link to "Item:Q894325"
From MaRDI portal
The following pages link to Efficient subset selection for the expected opportunity cost (Q894325):
Displaying 12 items.
- Simulation budget allocation for simultaneously selecting the best and worst subsets (Q1680908) (← links)
- An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints (Q1737808) (← links)
- Distributional and efficiency results for subset selection (Q1923398) (← links)
- Efficient simulation budget allocation for subset selection using regression metamodels (Q2280765) (← links)
- Robust ranking and selection with optimal computing budget allocation (Q2409209) (← links)
- Approximating Component Selection with General Costs (Q3628457) (← links)
- A New Budget Allocation Framework for the Expected Opportunity Cost (Q4604909) (← links)
- An efficient simulation procedure for the expected opportunity cost using metamodels (Q6049054) (← links)
- Asymptotic optimality of myopic ranking and selection procedures (Q6109037) (← links)
- Convergence rate analysis for optimal computing budget allocation algorithms (Q6110297) (← links)
- Marginal improvement procedures for top-\(m\) selection (Q6632511) (← links)
- Contextual ranking and selection with Gaussian processes and optimal computing budget allocation (Q6639391) (← links)