Universal alignment probabilities and subset selection for ordinal optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3816823 (Why is no real title available?)
- scientific article; zbMATH DE number 49622 (Why is no real title available?)
- scientific article; zbMATH DE number 3252837 (Why is no real title available?)
- Easily searched encodings for number partitioning
- Ordinal optimization of DEDS
- Using a standard clock technique for efficient simulation
Cited in
(16)- Ordinal optimization with subset selection rule
- Multi-objective ordinal optimization for simulation optimization problems
- Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline
- An illustrative case study on application of learning based ordinal optimization approach to complex deterministic problem
- An ordinal optimization theory-based algorithm for large distributed power systems
- Quantifying heuristics in the ordinal optimization framework
- Constrained ordinal optimization -- a feasibility model based approach
- The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems
- Universal alignment probability revisited
- Universal alignment probability revisited
- Constraint ordinal optimization
- Vector ordinal optimization
- An explanation of ordinal optimization: Soft computing for hard problems
- Comparison of selection rules for ordinal optimization
- Explanation of goal softening in ordinal optimization
- A soft approach for hard continuous optimization
This page was built for publication: Universal alignment probabilities and subset selection for ordinal optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357520)
