El problema del conjunto independiente en la selección de horarios de cursos
محفوظ في:
| المؤلفون: | , , , |
|---|---|
| التنسيق: | artículo original |
| الحالة: | Versión publicada |
| تاريخ النشر: | 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. |
| البلد: | 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 |
| كلمة مفتاحية: | Graph Theory Independent Set Operations Research Educational Timetabling Calendarización Conjunto Independiente Investigación de Operaciones Teoría de Gráficas |