Pareto Optimal Selection
Pareto Optimal Selection is a multi-trait selection strategy that identifies solutions in the Pareto frontier, where no single trait can be improved without degrading at least one other trait.
125
Publications
5.2K
Citations
409
Authors
206
Institutions
Publications per year
2017–2026
62
Parents
125
Optimal selection based on relative rank (the “secretary problem”)
Y. S. Chow, Sigeiti Moriguti, Herbert Robbins et al. · Israel Journal of Mathematics · 1964 · 214 citations
1–5 of 125
409
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 409
206

University of Tehran
Tehran, Iran
3 h-index
4 publications
283 citations

University of Padua
Padua, Italy
3 h-index
8 publications
619 citations
National University of Singapore
Singapore, Singapore
3 h-index
7 publications
372 citations
Université Paris-Est Créteil
Créteil, France
2 h-index
4 publications
148 citations

Radboud University Nijmegen
Nijmegen, The Netherlands
2 h-index
6 publications
96 citations
Columbia University
New York, United States
2 h-index
7 publications
982 citations

Stevens Institute of Technology
Hoboken, United States
2 h-index
5 publications
633 citations
Laboratoire d'Informatique de Grenoble
Grenoble, France
2 h-index
4 publications
65 citations
1–8 of 206
5 publications · 292 citations
5
h-index
3 publications · 140 citations
3
h-index
3 publications · 131 citations
3
h-index
3 publications · 192 citations
3
h-index
2 publications · 59 citations
2
h-index
1–5