Computer Science and Engineering, Department of
Date of this Version
2002
Abstract
We discuss the modeling and reformulation of a resource allocation problem, the assignment of graduate teaching assistants (GTAs) to courses. Our research contributes the following:
• Formulation of the GTA assignment problem as a nonbinary CSP.
• Design of a new convention for consistency checking to deal with over-constrained problem.
• Definition of a new network-decomposable nonbinary confinement constraint.
• Evaluation of the reformulation of confinement and equality constraints on 3 real-world data sets.
Comments
R. Glaubius and B.Y. Choueiry. Constraint Modeling and Reformulation in the Context of Academic Task Assignment. ECAI 2002 Workshop on Modelling and Solving Problems with Constraints, 2002.