Test-assignment: a quadratic coloring problem

Authors:
Jelle Duives;Andrea Lodi;Enrico Malaguti
Affiliations:
University of Twente, Enschede, The Netherlands;DEIS, Università di Bologna, Bologna, Italy;DEIS, Università di Bologna, Bologna, Italy
Venue:
Journal of Heuristics
Year:
2013

Citing 6
Cited 0

Using tabu search techniques for graph coloring

Computing
Self-scaled barriers and interior-point methods for convex programming

Mathematics of Operations Research
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem

Mathematical Programming: Series A and B
Assignment Problems

Assignment Problems
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Discrete Applied Mathematics
Extending the QCR method to general mixed-integer programs

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of assigning the test variants of a written exam to the desks of a classroom in such a way that desks that are close-by receive different variants. The problem is a generalization of the Vertex Coloring and we model it as a binary quadratic problem. Exact solution methods based on reformulating the problem in a convex way and applying a general-purpose solver are discussed as well as a Tabu Search algorithm. The methods are extensively evaluated through computational experiments on real-world instances.The problem arises from a real need at the Faculty of Engineering of the University of Bologna where the solution method is now implemented.