Integer programming methods for large-scale practical classroom assignment problems
From MaRDI portal
Recommendations
- Mathematical programming models and algorithms for a class--faculty assignment problem
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- Integer programming techniques for educational timetabling
- Integer programming for minimal perturbation problems in university course timetabling
- New integer linear programming approaches for course timetabling
- School Timetabling—A Case in Large Binary Integer Linear Programming
- scientific article; zbMATH DE number 679866
- Some Lessons in Solving Practical Integer Programs
- Integer programming for the generalized high school timetabling problem
Cites work
- A computational study of a cutting plane algorithm for university course timetabling
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies
- Application of a real-world university-course timetabling model solved by integer programming
- Balanced matrices
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Decomposition, reformulation, and diving in university course timetabling
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- ITC2007 solver description: a hybrid approach
- Multicriteria Optimization
- On the integer properties of scheduling set partitioning models
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Timetabling problems at the TU Eindhoven
- Towards improving the utilization of university teaching space
- When Is the Classroom Assignment Problem Hard?
Cited in
(22)- Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
- An overview of curriculum-based course timetabling
- Integer programming for minimal perturbation problems in university course timetabling
- Mathematical programming models and algorithms for a class--faculty assignment problem
- A 0/1 integer programming model for the office space allocation problem
- An integer programming model for assigning students to elective courses
- The maximum-impact coloring polytope
- Developing compact course timetables with optimized student flows
- The RaPID- system: room and Proctor intelligent decider for large scale tests programming
- Genetic based discrete particle swarm optimization for elderly day care center timetabling
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- When Is the Classroom Assignment Problem Hard?
- The class/teacher assignment problem: a case study in a Brazilian university
- Facet-generating procedures for the maximum-impact coloring polytope
- Comments on: ``An overview of curriculum-based course timetabling
- Schedules and Waitlists and Integer Programs, Oh My!
- Educational timetabling: problems, benchmarks, and state-of-the-art results
- Quality recovering of university timetables
- A polyhedral study of the maximum-impact coloring problem on hypergraphs
- University course timetabling with multi-section courses, room stability and lecturer preferences: an application in a business school
- An assignment problem and its application in education domain: a review and potential path
This page was built for publication: Integer programming methods for large-scale practical classroom assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337258)
