Name
Abstract | ||
|---|---|---|
Peer review of research proposals and articles is an essential element in R&D processes worldwide. In most cases, each reviewer evaluates a small subset of the candidate proposals. The review board is then faced with the challenge of creating an overall “consensus” ranking on the basis of many partial rankings. In this paper we propose a branch-and-bound model to support the construction of an aggregate ranking from the partial rankings provided by the reviewers. In a recent paper we proposed ways to allocate proposals to reviewers so as to achieve the maximum possible overlap among the subsets of proposals allocated to different reviewers. Here, we develop a special branch-and-bound algorithm that utilizes the overlap generated through our earlier methods to enable discrimination in ranking the competing proposals. The effectiveness and efficiency of the algorithm is demonstrated with small numerical examples and tested through an extensive simulation experiment. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.cor.2005.05.030 | Computers & Operations Research |
Keywords | DocType | Volume |
Peer review,Branch-and-bound algorithms | Journal | 34 |
Issue | ISSN | Citations |
4 | 0305-0548 | 29 |
PageRank | References | Authors |
1.22 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wade D. Cook | 1 | 1215 | 84.70 |
| Boaz Golany | 2 | 551 | 41.78 |
| Michal Penn | 3 | 325 | 43.38 |
| Tal Raviv | 4 | 115 | 9.51 |