Pages that link to "Item:Q1018245"
From MaRDI portal
The following pages link to Application of a real-world university-course timetabling model solved by integer programming (Q1018245):
Displaying 31 items.
- Developing compact course timetables with optimized student flows (Q322740) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (Q342395) (← links)
- Computational models for timetabling problem (Q478951) (← links)
- Preference-based assignment of university students to multiple teaching groups (Q480755) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- School timetabling for quality student and teacher schedules (Q842557) (← links)
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations (Q872118) (← links)
- A university-timetabling problem and its solution using Benders' partitioning---a case study (Q964875) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Modeling and solving a real-life assignment problem at universities (Q1303567) (← links)
- An integer programming formulation for a case study in university timetabling. (Q1417497) (← links)
- Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro (Q1748501) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Curriculum based course timetabling: new solutions to Udine benchmark instances (Q1761906) (← links)
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling (Q1761914) (← links)
- Efficient solutions for a university timetabling problem through integer programming (Q1887870) (← links)
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study (Q2225651) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- A computational approach to enhancing course timetabling with integer programming (Q2369205) (← links)
- A multi-stage IP-based heuristic for class timetabling and trainer rostering (Q2398428) (← links)
- A survey of metaheuristic-based techniques for university timetabling problems (Q2480804) (← links)
- Mixed integer linear programming models for university timetabling and its application (Q2864879) (← links)
- An integer programming model for assigning students to elective courses (Q2966476) (← links)
- A new adjustment of the branch and price algorithm for university course timetabling (Q5046123) (← links)
- (Q5077851) (← links)
- An integer program and a hybrid genetic algorithm for the university timetabling problem (Q5268943) (← links)
- Answer set programming as a modeling language for course timetabling (Q5398311) (← links)
- A matheuristic for customized multi-level multi-criteria university timetabling (Q6179219) (← links)
- A university-wide orientation course timetabling model and its modification for pandemic period (Q6191659) (← links)
