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

DOI10.1016/j.ejor.2019.01.035zbMath1430.90388OpenAlexW2908650596MaRDI QIDQ666946

Ali Yeşilçimen, E. Alper Yıldırım

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

mixed integer linear programmingassignmentsemidefinite programming relaxationoptimization based heuristicreviewer assignment problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Theory of organizations, manpower planning in operations research (90B70)

Uses Software

• YALMIP

Cites Work

• Unnamed Item
• Group-to-group reviewer assignment problem
• Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
• A general framework for distance-based consensus in ordinal ranking models
• Distance-based and ad hoc consensus models in ordinal preference ranking
• A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM
• On the Borda-Kendall Consensus Method for Priority Ranking Problems
• Priority Ranking and Consensus Formation
• Preference Structures. II: Distances Between Asymmetric Relations
• Limiting behavior of the central path in semidefinite optimization

This page was built for publication: An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem