An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem

DOI10.1016/J.EJOR.2019.01.035MaRDI QIDQ666946zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

assignmentmixed integer linear programmingsemidefinite programming relaxationoptimization based heuristicreviewer assignment problem

Mathematics Subject Classification ID

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)

Recommendations

• Group-to-group reviewer assignment problem
• A comprehensive survey of the reviewer assignment problem
• Assigning papers to referees
• Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
• Reviewer assignment for scientific articles using memetic algorithms

Cites work

• scientific article; zbMATH DE number 3405712 (Why is no real title available?)
• A comprehensive survey of the reviewer assignment problem
• A general framework for distance-based consensus in ordinal ranking models
• Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
• Distance-based and ad hoc consensus models in ordinal preference ranking
• Group-to-group reviewer assignment problem
• Limiting behavior of the central path in semidefinite optimization
• On the Borda-Kendall Consensus Method for Priority Ranking Problems
• Preference Structures. II: Distances Between Asymmetric Relations
• Priority Ranking and Consensus Formation

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
• Group-to-group reviewer assignment problem
• Assigning papers to referees
• 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

Describes a project that uses

Uses Software

• YALMIP

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)