Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10732-011-9176-0 | J. Heuristics |
Keywords | Field | DocType |
Binary quadratic programming,Reformulations,Heuristics | Mathematical optimization,Vertex (geometry),Quadratic equation,Regular polygon,Heuristics,Solver,Quadratic programming,Mathematics,Tabu search,Binary number | Journal |
Volume | Issue | ISSN |
19 | 4 | 1381-1231 |
Citations | PageRank | References |
1 | 0.35 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jelle Duives | 1 | 1 | 0.35 |
| Andrea Lodi | 2 | 2198 | 152.51 |
| Enrico Malaguti | 3 | 312 | 21.69 |