A clique-based algorithm for constructing feasible timetables
From MaRDI portal
Publication:3093045
DOI10.1080/10556781003664739zbMATH Open1225.90054OpenAlexW2025265020MaRDI QIDQ3093045FDOQ3093045
Yong-Kai Liu, Francis Y. L. Chin, Defu Zhang
Publication date: 12 October 2011
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/129976
Recommendations
- A tabu search algorithm with controlled randomization for constructing feasible university course timetables
- Timetable planning using the constraint-based reasoning
- A constraint-based approach to the timetabling problem
- scientific article; zbMATH DE number 1054932
- Solving a real constraint satisfaction model for the university course timetabling problem: a case study
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cited In (9)
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- ACLIPS: A capacity and lead time integrated procedure for scheduling
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- Extended clique initialisation in examination timetabling
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
- A column generation approach for solving the examination-timetabling problem
- An effective hybrid local search approach for the post enrolment course timetabling problem
- A tabu search algorithm with controlled randomization for constructing feasible university course timetables
- A clique search problem and its application to machine scheduling
This page was built for publication: A clique-based algorithm for constructing feasible timetables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093045)
