Article ID: | iaor19993116 |
Country: | Netherlands |
Volume: | 110 |
Issue: | 2 |
Start Page Number: | 223 |
End Page Number: | 233 |
Publication Date: | Oct 1998 |
Journal: | European Journal of Operational Research |
Authors: | Cangalovic Mirjana, Kovacevic-Vujcic Vera, Ivanovic Lav, Drazic Milan |
Keywords: | heuristics, graphs |
A real-life problem of assigning students to exams during an examination period is modeled as an optimization problem over the set of maximal cliques of a specially structured weighted graph. The problem is solved using a combination of special-purpose heuristic and Tabu search. Numerical results of experiments with real-life data from Belgrade Law School are reported.