Pages that link to "Item:Q3217921"
From MaRDI portal
The following pages link to School Timetabling—A Case in Large Binary Integer Linear Programming (Q3217921):
Displaying 34 items.
- A two-stage decomposition of high school timetabling applied to cases in Denmark (Q336881) (← links)
- Variable neighborhood search based algorithms for high school timetabling (Q337210) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- Elective course planning (Q420895) (← links)
- Term-end exam scheduling at United States Military Academy/West Point (Q707689) (← links)
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems (Q835631) (← links)
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations (Q872118) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← 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)
- A large scale timetabling problem (Q1112719) (← links)
- On the calculation of true and pseudo penalties in multiple choice integer programming (Q1183620) (← links)
- Modelling and solving an acyclic multi-period timetabling problem (Q1186307) (← links)
- Exchanges procedures for timetabling problems (Q1186312) (← links)
- Computerised decision aid for timetabling --- a case analysis (Q1186319) (← links)
- Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
- The course scheduling problem at Lufthansa technical training (Q1303529) (← links)
- Modeling and solving a real-life assignment problem at universities (Q1303567) (← links)
- A tabu search algorithm for computing an operational timetable (Q1331550) (← links)
- Covering the classroom requirements for the schools of Hamburg (Q1374417) (← links)
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. (Q1417487) (← links)
- An integer programming formulation for a case study in university timetabling. (Q1417497) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← 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)
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences (Q2355201) (← links)
- The consultation timetabling problem at Danish high schools (Q2359151) (← links)
- A computational approach to enhancing course timetabling with integer programming (Q2369205) (← links)
- New integer linear programming approaches for course timetabling (Q2468480) (← links)
- A survey of metaheuristic-based techniques for university timetabling problems (Q2480804) (← links)
- Lagrangian heuristics for instructor scheduling in executive development programmes (Q4363740) (← links)
- An integer program and a hybrid genetic algorithm for the university timetabling problem (Q5268943) (← links)
- Multi-objective faculty course assignment problem based on the double parametric form of fuzzy preferences (Q6660140) (← links)
