Search

The assignation of new students to schools could be considered a problem into the process that manages the student places at the Bogotá educational system. It is possible to model that problem like an assignation with similar objects, the solutions of this problem increase in complexity when consider the large number of students and other additional restrictions. This Document explores two strategies to approach the student assignation problem, which differ from the current "greedy" algorithm that is used into the assignation process. Initially a Branch and Price algorithm is discussed which presents convergence problems, and then the Auction Algorithm is studied. [ABSTRACT FROM AUTHOR]