An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem
DOI10.1016/J.EJOR.2019.01.035zbMATH Open1430.90388OpenAlexW2908650596MaRDI QIDQ666946FDOQ666946
Authors: Ali Yeşilçimen, E. Alper Yildirim 
Publication date: 12 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.01.035
Recommendations
assignmentmixed integer linear programmingsemidefinite programming relaxationoptimization based heuristicreviewer assignment problem
Approximation methods and heuristics in mathematical programming (90C59) Semidefinite programming (90C22) Mixed integer programming (90C11) Theory of organizations, manpower planning in operations research (90B70) Discrete location and assignment (90B80)
Cites Work
- A general framework for distance-based consensus in ordinal ranking models
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Priority Ranking and Consensus Formation
- Preference Structures. II: Distances Between Asymmetric Relations
- Title not available (Why is that?)
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
- On the Borda-Kendall Consensus Method for Priority Ranking Problems
- Group-to-group reviewer assignment problem
- A comprehensive survey of the reviewer assignment problem
- Limiting behavior of the central path in semidefinite optimization
Cited In (10)
- A statistical approach to calibrating the scores of biased reviewers of scientific papers
- A comprehensive survey of the reviewer assignment problem
- How to allocate review tasks for robust ranking
- Reviewer assignment for scientific articles using memetic algorithms
- Resource optimization for program committee members: a subreview article
- Assigning papers to referees
- Group-to-group reviewer assignment problem
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
- The k-Allocation Problem and Its Variants
- Into the unknown: assigning reviewers to papers with uncertain affinities
Uses Software
This page was built for publication: An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666946)
