Ordinal optimization with computing budget allocation for selecting an optimal subset
From MaRDI portal
Publication:2809316
Recommendations
Cites work
- A Simulation Budget Allocation Procedure for Enhancing the Efficiency of Optimal Subset Selection
- A three-stage procedure for selecting a good enough simulated system
- Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systems
- Ordinal optimization of DEDS
- Subset selection of best simulated systems
Cited in
(15)- Tractable sampling strategies for ordinal optimization
- Selecting the best system using the three-stage and the four-stage selection approaches
- A combined statistical selection procedure measured by the expected opportunity cost
- Optimal computing budget allocation for selecting the optimal subset of multi-objective simulation optimization problems
- Stopping rules for selecting the optimal subset
- Selecting a good stochastic system for the large number of alternatives
- An explanation of ordinal optimization: Soft computing for hard problems
- Integration of indifference-zone with multi-objective computing budget allocation
- Convergence rate analysis for optimal computing budget allocation algorithms
- scientific article; zbMATH DE number 2158377 (Why is no real title available?)
- Subset selection of best simulated systems
- Simulation budget allocation for simultaneously selecting the best and worst subsets
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Using ordinal optimization approach to improve efficiency of selection procedures
- Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems
This page was built for publication: Ordinal optimization with computing budget allocation for selecting an optimal subset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809316)