A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
From MaRDI portal
(Redirected from Publication:339653)
Recommendations
- A simulated annealing algorithm for university course timetabling considering travelling distances
- scientific article; zbMATH DE number 1054932
- A Simulated Annealing Genetic Algorithm for Solving Timetable Problems
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- University course timetabling problem using a heuristic approach based on uniform teaching resources
Cites work
- scientific article; zbMATH DE number 1728530 (Why is no real title available?)
- A Lagrangean Relaxation Approach to Course Timetabling
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- A Lagrangian relaxation approach to multi-period inventory/distribution planning
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- A decomposed metaheuristic approach for a real-world university timetabling problem
- A heuristic approach to simultaneous course/student timetabling
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Adaptive tabu search for course timetabling
- An effective hybrid algorithm for university course timetabling
- An integer programming formulation for a case study in university timetabling.
- Application of a real-world university-course timetabling model solved by integer programming
- Applied simulated annealing
- Computerised decision aid for timetabling --- a case analysis
- Decomposition, reformulation, and diving in university course timetabling
- Design and implementation of a course scheduling system using Tabu Search
- Efficient solutions for a university timetabling problem through integer programming
- Future paths for integer programming and links to artificial intelligence
- Neighborhood portfolio approach for local search applied to timetabling problems
- New integer linear programming approaches for course timetabling
- On the Complexity of Timetable and Multicommodity Flow Problems
- Optimization by simulated annealing
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
- Tabu search embedded simulated annealing for the shortest route cut and fill problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The teacher assignment problem: A special case of the fixed charge transportation problem
Cited in
(9)- Optimization in dubbing scheduling
- Solving university course timetabling problems using constriction particle swarm optimization with local search
- A simulated annealing algorithm for university course timetabling considering travelling distances
- Simulated annealing with penalization for university course timetabling
- Solving a real constraint satisfaction model for the university course timetabling problem: a case study
- A MILP model for the teacher assignment problem considering teachers' preferences
- Developing compact course timetables with optimized student flows
- Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university
- A fix-and-optimize heuristic for the high school timetabling problem
This page was built for publication: A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339653)
