El problema del conjunto independiente en la selección de horarios de cursos

Registration process at the Universidad Aut´onoma Metropolitana is such thatevery student is free to choose his/her own subjects and schedule. Success of thissystem, based in the percentage of students that obtain a place in the lectures chosen, depends principally on the characteristics of the supp...

Full description

Main Authors: López Bracho, Rafael, Gutiérrez Andrade, Miguel Ángel, Ortuño Sánchez, María Paula, Ramírez Rodríguez, Javier
Format: Artículo
Language: Español
Published: 2015
Online Access: http://revistas.ucr.ac.cr/index.php/matematica/article/view/231
http://hdl.handle.net/10669/12874
Summary: Registration process at the Universidad Aut´onoma Metropolitana is such thatevery student is free to choose his/her own subjects and schedule. Success of thissystem, based in the percentage of students that obtain a place in the lectures chosen, depends principally on the characteristics of the supply of scheduled lectures, relativesto quantity and variety of timetables, as well as the oportunity of the students todo an adequate selection of lectures. An adequate selection of lectures is a subset ofthe lectures set with pairwise different subjects and timetables. The Choose LecturesProblem is to find the maximal adequate selection of lectures. A Graph Theory modelof the problem and an algorithm to solve it will be shown.Keywords: Graph Theory, Independent Set, Operations Research, Educational Timetabling.