Pages that link to "Item:Q1818951"

The following pages link to An explanation of ordinal optimization: Soft computing for hard problems (Q1818951):

Displaying 15 items.

• Quantifying heuristics in the ordinal optimization framework (Q609560) (← links)
• Embedding evolutionary strategy in ordinal optimization for hard optimization problems (Q693487) (← links)
• Constrained ordinal optimization -- a feasibility model based approach (Q859742) (← links)
• Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty (Q862513) (← links)
• Ordinal optimization and quantification of heuristic designs (Q977007) (← links)
• Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline (Q1016394) (← links)
• Simple explanation of the no-free-lunch theorem and its implications (Q1411370) (← links)
• Constraint ordinal optimization (Q1810456) (← links)
• A probabilistic solution-generator for simulation (Q1869509) (← 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 new approach to discrete stochastic optimization problems (Q2488904) (← links)
• An ordinal optimization based evolution strategy to schedule complex make-to-order products (Q3430256) (← links)
• Simulation optimization: a review of algorithms and applications (Q5919176) (← links)