Modeling a balanced commute educational timetabling problem in the context of teaching Integer Programming.
Christos GogosAngelos DimitsasChristos ValouxisPanayiotis AlefragisPublished in: SEEDA-CECNSM (2022)
Keyphrases
- integer programming
- timetabling problem
- e learning
- production planning
- constraint programming
- lagrangian relaxation
- educational technology
- np hard
- linear programming
- cutting plane
- set covering
- cutting plane algorithm
- column generation
- ai planning
- examination timetabling
- learning analytics
- teacher education
- vehicle routing problem with time windows
- set covering problem
- school teachers
- set partitioning
- integer program
- valid inequalities
- teaching methods
- blended learning
- distance learning
- optimization algorithm
- special case
- evolutionary algorithm