Pages that link to "Item:Q1581038"
From MaRDI portal
The following pages link to Simulation budget allocation for further enhancing the efficiency of ordinal optimization (Q1581038):
Displaying 50 items.
- Stochastic resource allocation using a predictor-based heuristic for optimization via simulation (Q336991) (← links)
- Subset selection of best simulated systems (Q357960) (← links)
- Some insights of using common random numbers in selection procedures (Q373006) (← links)
- An efficient simulation budget allocation method incorporating regression for partitioned domains (Q458756) (← links)
- Parameterized Markov decision process and its application to service rate control (Q492972) (← links)
- An enhanced lognormal selection procedure (Q539494) (← links)
- Quantifying heuristics in the ordinal optimization framework (Q609560) (← links)
- Continuous optimization via simulation using golden region search (Q621655) (← links)
- Computing budget allocation rules for multi-objective simulation models based on different measures of selection quality (Q624935) (← links)
- Self-adjusting the tolerance level in a fully sequential feasibility check procedure (Q724172) (← links)
- Particle swarm optimization for function optimization in noisy environment (Q856065) (← links)
- Supervision based on place invariants: a survey (Q858151) (← links)
- Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty (Q862513) (← links)
- Efficient subset selection for the expected opportunity cost (Q894325) (← links)
- Differentiated service inventory optimization using nested partitions and MOCBA (Q959521) (← links)
- A multi-objective selection procedure of determining a Pareto set (Q1000971) (← links)
- Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline (Q1016394) (← links)
- Integration of indifference-zone with multi-objective computing budget allocation (Q1046117) (← links)
- Top-\(\kappa\) selection with pairwise comparisons (Q1634303) (← links)
- A combined statistical selection procedure measured by the expected opportunity cost (Q1640622) (← links)
- Simulation budget allocation for simultaneously selecting the best and worst subsets (Q1680908) (← links)
- Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems (Q1718781) (← links)
- An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints (Q1737808) (← links)
- Comparison of Kriging-based algorithms for simulation optimization with heterogeneous noise (Q1753578) (← links)
- Sequential selection procedures: using sample means to improve efficiency (Q1779540) (← links)
- On the probability of correct selection in ordinal comparison over dynamic networks (Q1935307) (← links)
- Considering sample means in Rinott's procedure with a Bayesian approach (Q1991285) (← links)
- Memory based self-adaptive sampling for noisy multi-objective optimization (Q1999117) (← links)
- An extended two-stage sequential optimization approach: properties and performance (Q2023982) (← links)
- Pareto set estimation with guaranteed probability of correct selection (Q2030571) (← links)
- Adaptive sampling line search for local stochastic optimization with integer variables (Q2097662) (← links)
- Efficient estimation of a risk measure requiring two-stage simulation optimization (Q2103034) (← links)
- Optimal budget allocation policy for tabu search in stochastic simulation optimization (Q2108143) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm (Q2150758) (← links)
- Comparison with a standard via all-pairwise comparisons (Q2256884) (← links)
- Efficient simulation budget allocation for subset selection using regression metamodels (Q2280765) (← links)
- Efficient simulation budget allocation for ranking the top \(m\) designs (Q2320691) (← links)
- An accelerated stopping rule for the nested partition hybrid algorithm for discrete stochastic optimization (Q2348379) (← links)
- Robust ranking and selection with optimal computing budget allocation (Q2409209) (← links)
- Comparison of selection rules for ordinal optimization (Q2473192) (← links)
- Multi-objective simulation-based evolutionary algorithm for an aircraft spare parts allocation problem (Q2480988) (← links)
- A new approach to discrete stochastic optimization problems (Q2488904) (← links)
- A general framework on the simulation-based optimization under fixed computing budget (Q2503253) (← links)
- Ranking and selection for multiple performance measures using incomplete preference information (Q2630111) (← links)
- Optimal computing budget allocation for the vector evaluated genetic algorithm in multi-objective simulation optimization (Q2665097) (← links)
- Optimal computing budget allocation for regression with gradient information (Q2665728) (← links)
- Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments (Q2795876) (← links)
- Selecting a Good Stochastic System for the Large Number of Alternatives (Q2905732) (← links)
- On the Convergence Rates of Expected Improvement Methods (Q2957473) (← links)
