El problema del conjunto independiente en la selección de horarios de cursos
Guardado en:
| Autores: | , , , |
|---|---|
| 格式: | artículo original |
| 狀態: | Versión publicada |
| Fecha de Publicación: | 2003 |
| 實物特徵: | Registration process at the Universidad Aut´onoma Metropolitana is such that every student is free to choose his/her own subjects and schedule. Success of this system, 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, relatives to quantity and variety of timetables, as well as the oportunity of the students to do an adequate selection of lectures. An adequate selection of lectures is a subset of the lectures set with pairwise different subjects and timetables. The Choose Lectures Problem is to find the maximal adequate selection of lectures. A Graph Theory model of the problem and an algorithm to solve it will be shown. |
| País: | Portal de Revistas UCR |
| 機構: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 語言: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/231 |
| 在線閱讀: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/231 |
| Palabra clave: | Graph Theory Independent Set Operations Research Educational Timetabling Calendarización Conjunto Independiente Investigación de Operaciones Teoría de Gráficas |