Comparison of selection rules for ordinal optimization
From MaRDI portal
Recommendations
Cites work
- An explanation of ordinal optimization: Soft computing for hard problems
- scientific article; zbMATH DE number 1060043 (Why is no real title available?)
- Optimization for simulation: theory vs. practice
- Ordinal optimization for a class of deterministic and stochastic discrete resource allocation problems
- Ordinal optimization of DEDS
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Universal alignment probabilities and subset selection for ordinal optimization
- Universal alignment probability revisited
Cited in
(14)- Ordinal optimization approach to rare event probability problems
- On the probability of correct selection in ordinal comparison over dynamic networks
- A discussion on performance value versus performance order
- Comparing optimization algorithms for item selection in Mokken scale analysis
- scientific article; zbMATH DE number 5823899 (Why is no real title available?)
- Ordinal optimisation and simulation
- Learning criteria weights of an optimistic Electre Tri sorting rule
- A lower bound for the correct subset-selection probability and its application to discrete-event system simulations
- Tractable sampling strategies for ordinal optimization
- Quantifying heuristics in the ordinal optimization framework
- Ordinal optimization with subset selection rule
- Using ordinal optimization approach to improve efficiency of selection procedures
- Constrained ordinal optimization -- a feasibility model based approach
- Ordinal optimization and quantification of heuristic designs
This page was built for publication: Comparison of selection rules for ordinal optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473192)
