Dealing with the Balanced Academic Curriculum Problem considering the Chilean Academic Credit Transfer System The curricular design of the academic programs and the distribution of the academic load has become a controversial topic since it is related to the health and performance of the students. In Chile, the load of the academic programs has to be distributed and balanced according to the Chilean Academic Credit Transfer System recommendations. The Balanced academic curriculum problem has been studied in computer science, being defined as the assignation of courses to academic periods satisfying all the prerequisite constraints. In this work, we implement two strategies to deal with this problem, a quadratic integer programming model and a genetic algorithm approach, and evaluate them using wellknow data sets from the literature. Next, these strategies are adapted to study the balance of the load of six real engineering academic programs according to the Chilean credit references. The results show that both approaches obtained the optimal solutions for the literature data sets, and were able to find solutions which improve the balance of the real academic programs, distributing uniformly the load between periods.

An Algorithm for Strong Stability in the StudentProject Allocation Problem with Ties We study a variant of the StudentProject Allocation problem with lecturer preferences over Students where ties are allowed in the preference lists of students and lecturers (spast). We investigate the concept of strong stability in this context. Informally, a matching is strongly stable if there is no student and lecturer l such that if they decide to form a private arrangement outside of the matching via one of lxe2x80x99s proposed projects, then neither party would be worse off and at least one of them would strictly improve. We describe the first polynomialtime algorithm to find a strongly stable matching or report that no such matching exists, given an instance of spast. Our algorithm runs in (O(m2)) time, where m is the total length of the studentsxe2x80x99 preference lists.