Integer programming methods for large-scale practical classroom assignment problems
DOI10.1016/J.COR.2014.07.012zbMATH Open1348.90300OpenAlexW1986747979MaRDI QIDQ337258FDOQ337258
Antony E. Phillips, Hamish Waterer, Matthias Ehrgott, David M. Ryan
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/75294/1/roomAssignmentv13.pdf
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
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Multicriteria Optimization
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- ITC2007 solver description: a hybrid approach
- Setting the research agenda in automated timetabling: the second international timetabling competition
- A computational study of a cutting plane algorithm for university course timetabling
- Towards improving the utilization of university teaching space
- When Is the Classroom Assignment Problem Hard?
- 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
- Decomposition, reformulation, and diving in university course timetabling
- On the integer properties of scheduling set partitioning models
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- Balanced matrices
- Timetabling problems at the TU Eindhoven
Cited In (16)
- Integer programming for minimal perturbation problems in university course timetabling
- An overview of curriculum-based course timetabling
- When Is the Classroom Assignment Problem Hard?
- Facet-generating procedures for the maximum-impact coloring polytope
- An assignment problem and its application in education domain: a review and potential path
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- Comments on: ``An overview of curriculum-based course timetabling
- An integer programming model for assigning students to elective courses
- Developing compact course timetables with optimized student flows
- Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university
- The maximum-impact coloring polytope
- Genetic based discrete particle swarm optimization for elderly day care center timetabling
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
- Quality recovering of university timetables
- Mathematical programming models and algorithms for a class--faculty assignment problem
- Educational timetabling: problems, benchmarks, and state-of-the-art results
Uses Software
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)
