A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM
From MaRDI portal
Publication:3585099
DOI10.1142/S0219622010003993zbMath1209.90233MaRDI QIDQ3585099
Publication date: 19 August 2010
Published in: International Journal of Information Technology & Decision Making (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- A survey of algorithms for the generalized assignment problem
- The \(k\)-cardinality assignment problem
- Conference paper assignment
- The Assignment Problem with Seniority and Job Priority Constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A NEW APPROACH FOR TEXT SIMILARITY USING ARTICLES
- IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM
- When Is the Classroom Assignment Problem Hard?
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Gentle Introduction to Memetic Algorithms
- Algorithms for the set covering problem
This page was built for publication: A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM