Pages that link to "Item:Q3156566"
From MaRDI portal
The following pages link to Ordinal optimisation and simulation (Q3156566):
Displaying 36 items.
- Stochastic resource allocation using a predictor-based heuristic for optimization via simulation (Q336991) (← links)
- Quantifying heuristics in the ordinal optimization framework (Q609560) (← links)
- Optimization for simulation: LAD accelerator (Q646715) (← links)
- Embedding evolutionary strategy in ordinal optimization for hard optimization problems (Q693487) (← links)
- Ordinal optimization with subset selection rule (Q700726) (← links)
- Using ordinal optimization approach to improve efficiency of selection procedures (Q702838) (← links)
- On ordinal comparison of policies in Markov reward processes (Q852153) (← links)
- Constrained ordinal optimization -- a feasibility model based approach (Q859742) (← links)
- Towards logistics systems parameter optimisation through the use of response surfaces (Q882649) (← links)
- Ordinal optimization and quantification of heuristic designs (Q977007) (← links)
- Ordinal optimization of DEDS (Q1198421) (← links)
- Convergence rate of ordinal optimization for stochastic discrete event systems (Q1286415) (← links)
- Alignment properties in ordinal comparison of discrete event dynamic systems (Q1304056) (← links)
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization (Q1581038) (← links)
- Ordinal comparison via the nested partitions method (Q1610355) (← links)
- Solving a class of simulation-based optimization problems using ``optimality in probability'' (Q1745940) (← links)
- Vector ordinal optimization (Q1780585) (← links)
- Constraint ordinal optimization (Q1810456) (← links)
- An explanation of ordinal optimization: Soft computing for hard problems (Q1818951) (← links)
- Standard clock simulation and ordinal optimization applied to admission control in integrated communication networks (Q1901413) (← links)
- Ordinal optimization approach to rare event probability problems (Q1901415) (← links)
- On the probability of correct selection in ordinal comparison over dynamic networks (Q1935307) (← links)
- The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems (Q2256885) (← links)
- The time buffer approximated buffer allocation problem: a row-column generation approach (Q2289911) (← links)
- Rapid screening algorithms for stochastically constrained problems (Q2400026) (← links)
- Multi-objective ordinal optimization for simulation optimization problems (Q2470041) (← links)
- Comparison of selection rules for ordinal optimization (Q2473192) (← links)
- Stochastic optimization using simulated annealing with hypothesis test (Q2489372) (← links)
- On modification of population-based search algorithms for convergence in stochastic combinatorial optimization (Q2808309) (← links)
- A comparison of refinement orderings and their associated simulation rules (Q2844831) (← links)
- Merging the Ranking and Selection into ITO Algorithm for Simulation Optimization (Q3058943) (← links)
- Simulation by repeated optimisation (Q3157344) (← links)
- Universal alignment probability revisited (Q5894853) (← links)
- Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
- Convergence rate analysis for optimal computing budget allocation algorithms (Q6110297) (← links)
- Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise (Q6166097) (← links)