Pages that link to "Item:Q1357520"
From MaRDI portal
The following pages link to Universal alignment probabilities and subset selection for ordinal optimization (Q1357520):
Displaying 16 items.
- An ordinal optimization theory-based algorithm for large distributed power systems (Q604034) (← links)
- Quantifying heuristics in the ordinal optimization framework (Q609560) (← links)
- Ordinal optimization with subset selection rule (Q700726) (← links)
- An illustrative case study on application of learning based ordinal optimization approach to complex deterministic problem (Q858354) (← links)
- Constrained ordinal optimization -- a feasibility model based approach (Q859742) (← links)
- Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline (Q1016394) (← links)
- Vector ordinal optimization (Q1780585) (← links)
- Constraint ordinal optimization (Q1810456) (← links)
- An explanation of ordinal optimization: Soft computing for hard problems (Q1818951) (← links)
- The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems (Q2256885) (← links)
- Multi-objective ordinal optimization for simulation optimization problems (Q2470041) (← links)
- Comparison of selection rules for ordinal optimization (Q2473192) (← links)
- A soft approach for hard continuous optimization (Q2491765) (← links)
- Universal alignment probability revisited (Q5894853) (← links)
- Universal alignment probability revisited (Q5902138) (← links)
- Simulation optimization: a review of algorithms and applications (Q5919176) (← links)
