1997
DOI: 10.1023/a:1022614327007
|View full text |Cite
|
Sign up to set email alerts
|

Universal Alignment Probabilities and Subset Selection for Ordinal Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
117
0

Year Published

2003
2003
2017
2017

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 150 publications
(117 citation statements)
references
References 8 publications
0
117
0
Order By: Relevance
“…Instead, the task is to find a satisfactory solution with some guarantees on quality (called alignment probability) [127]. Here, the focus is on sampling a chosen subset of the solutions and evaluating them to determine the best among them.…”
Section: Large/infinite Parameter Spacesmentioning
confidence: 99%
“…Instead, the task is to find a satisfactory solution with some guarantees on quality (called alignment probability) [127]. Here, the focus is on sampling a chosen subset of the solutions and evaluating them to determine the best among them.…”
Section: Large/infinite Parameter Spacesmentioning
confidence: 99%
“…The searching process in the procedure would be reduced. To obtain the top optimum proportion solutions, Lau and Ho [52] noted that the top 5% of solutions can be treated as a reliable criterion with a very high probability (≥0.95) of obtaining satisfactory solutions.…”
Section: Ordinal Optimization Approachmentioning
confidence: 99%
“…In ordinal optimization, the objective is not to determine the one best policy but rather to select a policy which, due to its significantly high probability, is has the highest percentile of ranking among all possible policies [5,6].…”
Section: Ordinal Optimizationmentioning
confidence: 99%