Universal alignment probability revisited
From MaRDI portal
Publication:5894853
DOI10.1023/A:1014891211119zbMath1005.93052OpenAlexW1574743792MaRDI QIDQ5894853
No author found.
Publication date: 8 October 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014891211119
ordinal optimizationselected subsetalignment probabilitygood enough subsetmatching subsets by samplesordered performance curve
Related Items (7)
Constrained ordinal optimization -- a feasibility model based approach ⋮ An ordinal optimization theory-based algorithm for large distributed power systems ⋮ Quantifying heuristics in the ordinal optimization framework ⋮ Universal alignment probability revisited ⋮ Comparison of selection rules for ordinal optimization ⋮ The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems ⋮ Vector ordinal optimization
Cites Work
- Unnamed Item
- Universal alignment probabilities and subset selection for ordinal optimization
- Standard clock simulation and ordinal optimization applied to admission control in integrated communication networks
- Ordinal optimisation and simulation
- Ordinal optimization for a class of deterministic and stochastic discrete resource allocation problems
This page was built for publication: Universal alignment probability revisited
